| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874210 | Information Processing Letters | 2018 | 5 Pages |
Abstract
In this note, we observe that in a variety of computational models, if f is a random function then with high probability its corresponding choice and agreement problem are not much easier than computing f on a single instance (as long as m is noticeably smaller than 2n).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Or Meir, Avishay Tal,