Fooling parity tests with parity gates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 381-392

  Gutfreund, Dan ^a   Viola, Emanuele ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES;

COMBINATORIAL DESIGN; CONSTANT FACTORS; CONSTANT-DEPTH CIRCUITS; EXPANDER GRAPHS; NEW CONSTRUCTIONS; PARITY GATES; POLYNOMIAL FACTOR; RANDOM WALK;

APPROXIMATION ALGORITHMS;

EID: 35048863410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_34     Document Type: Article

References (22)

1. +01] M. Agrawal, E. Allender, R. Impagliazzo, T. Pitassi, and S. Rudich. Reducing the complexity of reductions. Comput. Complexity, 10(2):117-138, 2001.
2. [ABI86] N. Alon, L. Babai, and A. Itai. A fast and simple randomized algorithm for the maximal independent set problem. J. of algorithms, 7:567-583, 1986.
3. [AGHP92] N. Alon, O. Goldreich, J. Hâstad, and R. Peralta. Simple constructions of almost k-wise independent random variables. Random Structures Algorithms, 3(3):289-304, 1992.
4. [Ajt93] M. Ajtai. Approximate counting with uniform constant-depth circuits. In Advances in computational complexity theory (New Brunswick, NJ, 1990), pages 1-20. Amer. Math. Soc., Providence, RI, 1993.
5. [BIS90] D.A.M. Barrington, N. Immerman, and H. Straubing. On uniformity within JVC1. J. Comput. System Sci., 41(3):274-306, 1990.
6. 1. RAIRO Theoretical Informatics and Applications, 35:259-276, 2001.
7. [CG89] B. Chor and O. Goldreich. On the power of two-point based sampling. Journal of Complexity, 5(1):96-106, March 1989.
8. +85] B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich, and R. Smolensky. The bit extraction problem and t-resilient functions. In 26th Annual Symposium on Foundations of Computer Science, pages 396-407, Portland, Oregon, 21-23 October 1985. IEEE.
9. [GG81] O. Gabber and Z. Galil. Explicit constructions of linear size superconcentrators. JCSS, 22:407-420, 1981.
10. [Gol99] O. Goldreich. Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1999.
11. [HR03] T. Hartman and R. Raz. On the distribution of the number of roots of polynomials and explicit weak designs. Random Structures & Algorithms, 23(3):235-263, 2003.
12. [JM87] S. Jimbo and A. Maruoka. Expanders obtained from affine transformations. Combinatorica, 7(4):343-355, 1987.
13. [Mar73] G. A. Margulis. Explicit construction of concentrator. Problems Inform. Transmission, 9:325-332, 1973.
14. [MNT90] Yishay Mansour, Noam Nisan, and Prasoon Tiwari. The computational complexity of universal hashing. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (May 14-16 1990: Baltimore, MD, USA), pages 235-243, New York, NY 10036, USA, 1990. ACM Press.
15. [Nep70] V.A. Nepomnjašcii. Rudimentary predicates and turing calculations. Soviet Mathematics-Doklady, 11(6):1462-1465, 1970.
16. [NN90] J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the Twenty-Second Annual ACM Symposium on the Theory of Computing, pages 213-223, 1990.
17. [NW94] N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, October 1994.
18. [SS96] M. Sipser and D.A. Spielman. Expander codes. IEEE Trans. Inform. Theory, 42:1710-1722, 1996.
19. [Vio04] E. Viola. The complexity of constructing pseudorandom generators from hard functions. Technical Report TR04-020, Electronic Colloquium on Computational Complexity, 2004. http://www.eccc.uni-trier.de/eccc. To appear in Journal of Computational Complexity.
20. [vL99] J. H. van Lint. Introduction to coding theory, volume 86 of Graduate Texts in Mathematics. Springer-Verlag, Berlin, third edition, 1999.
21. [Vol99] H. Vollmer. Introduction to circuit complexity. Springer-Verlag, Berlin, 1999.
22. [ZBYW99] O. Goldreich Z. Bar-Yossef and A. Wigderson. Deterministic amplification of space bounded probabilistic algorithms. In Proceedings of the 14nd Annual IEEE Conference on Computational Complexity, pages 188-198, 1999.