Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
نویسندگان
چکیده
منابع مشابه
New Proofs of (New) Direct Product Theorems
Direct product theorems are formal statements of the intuition, “It is harder to solve multiple instances of a problem than to solve a single instance.” For this talk, the amplification of hardness will be in reducing the probability of success for a feasible algorithm. So a direct product result for circuits might say, “If no small circuit can compute Boolean function f(x) with probability at ...
متن کاملOn Uniform Recurrence of a Direct Product
The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly recurrent if each its subword occurs in it with bounded gaps. An infinite word is strongly recurrent if the direct product of it with each uniformly recurrent word is also uniformly recurrent. We prove that fixed points of the expanding binary symmetric morphisms are st...
متن کاملOn Uniform Reductions between Direct Product and XOR Lemmas
There is a close connection between Direct Product and XOR lemmas in the sense that in many settings, we can prove one given the other. The known reductions that are used for the above purpose are either in the non-uniform setting or give non-matching parameters. By non-matching parameter we mean that k-wise Direct Product lemma implies k′-wise XOR lemma (and vice versa) for k 6= k′. In this wo...
متن کاملDirect Product Theorems for Classical Communication Complexity via Subdistribution Bounds
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of classical communication complexity. We introduce a new measure, the subdistribution bound , which is a relaxation of the wellstudied rectangle or c...
متن کاملDirect Product Theorems for Communication Complexity via Subdistribution Bounds
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of classical communication complexity. We define a new measure, the subdistribution bound , which is a generalization of the well-studied rectangle or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2010
ISSN: 0097-5397,1095-7111
DOI: 10.1137/080734030