Abstract
This note proves the existence of a quadratic GF(2) map p: {0, 1}n → {0, 1} such that no constant-depth circuit of size poly(n) can sample the distribution (u, p(u)) for uniform u.
- László Babai. 1987. Random oracles separate PSPACE from the polynomial-time hierarchy. Inform. Process. Lett. 26, 1 (1987), 51--53. Google Scholar
Digital Library
- Chris Beck, Russell Impagliazzo, and Shachar Lovett. 2012. Large deviation bounds for decision trees and sampling lower bounds for AC0-circuits. Electron. Colloquium Computat. Complexity (ECCC) 19 (2012), 42.Google Scholar
- Itai Benjamini, Gil Cohen, and Igor Shinkar. 2014. Bi-Lipschitz bijection between the boolean cube and the hamming ball. In IEEE Symp. on Foundations of Computer Science (FOCS’14). Google Scholar
Digital Library
- Anindya De and Thomas Watson. 2012. Extractors and lower bounds for locally samplable sources. ACM Trans. Computat. Theory 4, 1 (2012), 3. Google Scholar
Digital Library
- Russell Impagliazzo and Moni Naor. 1996. Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9, 4 (1996), 199--216. Google Scholar
Digital Library
- Shachar Lovett and Emanuele Viola. 2012. Bounded-depth circuits cannot sample good codes. Computat. Complexity 21, 2 (2012), 245--266. Google Scholar
Digital Library
- Emanuele Viola. 2012a. The complexity of distributions. SIAM J. Comput. 41, 1 (2012), 191--218. Google Scholar
Digital Library
- Emanuele Viola. 2012b. Extractors for turing-machine sources. In Workshop on Randomization and Computation (RANDOM’12).Google Scholar
Cross Ref
- Emanuele Viola. 2014a. Is Nature a low complexity sampler? http://emanueleviola.wordpress.com/2014/11/09/is-nature-a-low-comple xity-sampler.Google Scholar
- Emanuele Viola. 2014b. Extractors for circuit sources. SIAM J. Comput. 43, 2 (2014), 355--972.Google Scholar
Cross Ref
Index Terms
Quadratic Maps Are Hard to Sample
Recommendations
Pseudorandom Generators without the XOR Lemma
COCO '99: Proceedings of the Fourteenth Annual IEEE Conference on Computational ComplexityImpagliazzo and Wigderson (STOC 97) have recently shown that if there exists a decision problem solvable in time 2^{O(n)} and having circuit complexity 2^{Omega(n)} (for all but finitely many n) then P=BPP. This result is a culmination of a series of ...
Pseudorandom Generators without the XOR Lemma
Special issue on the fourteenth annual IEE conference on computational complexityR. Impagliazzo and A. Wigderson (1997, in “Proceedings of the twenty-ninth Annual ACM Symposium on Theory of Computing,” pp. 220 229) have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (...
Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (extended abstract)
CCC '15: Proceedings of the 30th Conference on Computational ComplexityA circuit C compresses a function f : {0, 1}n → {0, 1}m if given an input x ∈ {0, 1}n the circuit C can shrink x to a shorter ℓ-bit string x' such that later, a computationally-unbounded solver D will be able to compute f(x) based on x'. In this paper ...








Comments