A stateful implementation of a random function supporting parity queries over hypercubes

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

Volumn 3122, Issue , 2004, Pages 298-309

  Bogdanov, Andrej ^a   Wee, Hoeteck ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GEOMETRY; OPTIMIZATION;

BINARY FUNCTIONS; CHARACTERISTIC VECTORS; DETERMINISTIC ALGORITHMS; LINEAR DEPENDENCY; MODELS OF COMPUTATION; POLYNOMIAL IDENTITY TESTING; RANDOM FUNCTIONS; RANDOMIZED ALGORITHMS;

APPROXIMATION ALGORITHMS;

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

References (7)

1. Scott Aaronson. Multilinear formulas and skepticism of quantum computing. Proceedings of the 36th ACM Symposium on Theory of Computing, 2004.
2. Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):210-217, 1986.
3. Oded Goldreich, Shafi Goldwasser, and Asaf Nussboim. On the implementation of huge random objects. Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 68-79, 2003. Preliminary full version at http://www.wisdom.weizmann.ac.il/~oded/p_toro.html.
4. Michael Luby and Charles Rackoff. How to construct pseudorandom permutations from pseudoranom functions. SICOMP, 17:373-386, 1988.
5. Ran Raz and Amir Shpilka. Deterministic polynomial identity testing in non commutative models. Proceedings of the 17th Conference on Computational Complexity, 2004. To appear.
6. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980.
7. R. E. Zippel. Probabilistic algorithms for sparse polynomials. Proceedings of EUROSAM 79, 216-226, 1979.