On approximate majority and probabilistic time

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 155-168

  Viola, Emanuele ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBABILISTIC LOGICS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATE MAJORITY; LINEAR SPACE; PROBABILISTIC TIME;

LOGIC CIRCUITS;

EID: 34748879612     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.16     Document Type: Conference Paper

References (40)

1. 1-formulae on finite structures. Ann. Pure Appl. Logic, 24(1):1-48, 1983.
2. M. Ajtai. Approximate counting with uniform constantdepth circuits. In Advances in computational complexity theory (New Brunswick, NJ, 1990), pages 1-20. Amer. Math. Soc., Providence, RI, 1993.
3. M. Ajtai and M. Ben-Or. A theorem on probabilistic constant depth computation. In ACM, editor, Proceedings of the sixteenth annual ACM Symposium on Theory of Computing, Washington, DC, April 30-May 2, 1984, pages 471-474, 1984.
4. E. Allender, M. Koucký, D. Ronneburger, S. Roy, and V. Vinay. Time-space tradeoffs in the counting hierarchy. In Proceedings of the Sixteenth Annual Conference on Computational Complexity, pages 295-302. IEEE, June 18-21 2001.
5. 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.
6. J. L. Balcazar, J. Diaz, and J. Gabarro. Structural complexity Theory. Springer-Verlag New York, Inc., New York, NY, USA, 1988.
7. P. Beame, M. Saks, X. Sun, and E. Vee. Time-space trade-off lower bounds for randomized computation of decision problems. J ACM, 50(2): 154-195 (electronic), 2003.
8. R. Canetti. More on BPP and the polynomial-time hierarchy. Inform. Process. Lett., 57(5):237-241, 1996.
9. S. Chaudhuri and J. Radhakrishnan. Deterministic restrictions in circuit complexity. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 30-36, Philadelphia, Pennsylvania, 22-24 May 1996.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, Cambridge, MA, second edition, 2001.
11. S. Diehl and D. van Melkebeek. Time-space lower bounds for the polynomial-time hierarchy on randomized machines. SIAM J. Comput., 36(3):563-594, 2006.
12. S. Even, A. L. Selman, and Y. Yacobi. The complexity of promise problems with applications to public-key cryptography. Inform. and Control, 61 (2): 159-173, 1984.
13. L. Fortnow, R. Lipton, D. van Melkebeek, and A. Vigias. Time-space lower bounds for satisfiability. To appear in Journal of the ACM, Available from http://www.cs.wisc.edu/~dieter/Research/sat-ts.html, 2005.
14. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, April 1984.
15. O. Gabber and Z. Galil. Explicit constructions of linear size superconcentrators. Journal of Computer and System Sciences, 22:407-420, 1981.
16. D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4): 1203-1220 (electronic), 1998.
17. O. Goldreich. Modern cryptography, probabilistic proofs and pseudorandomness, volume 17 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1999.
18. O. Goldreich and D. Zuckerman. Another proof that BPP C PH (and more). Electronic Colloquium on Computational Complexity, Technical Report TR97-045, September 1997. http://www.eccc.uni-trier.de/eccc.
19. J. Håstad. Computational limitations of small-depth circuits. MIT Press, 1987.
20. R. Impagliazzo, N. Nisan, and A. Wigderson. Pseudorandomness for network algorithms. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 356-364, Montréal, Québec, Canada, 23-25 May 1994.
21. S. Jimbo and A. Maruoka. Expanders obtained from affine transformations. Combinatorica, 7(4):343-355, 1987.
22. N. Kahale. Eigenvalues and expansion of regular graphs. J. Assoc. Comput. Mach., 42(5): 1091-1106, 1995.
23. E. Kushilevitz and N. Nisan. Communication complexity. Cambridge University Press, Cambridge, 1997.
24. C. Lautemann. BPP and the polynomial hierarchy. Inform. Process. Lett., 17(4):215-217, 1983.
25. W. Maass and A. Schorr. Speed-up of Turing machines with one work tape and a two-way input tape. SIAM J. Comput., 16(1):195-202, 1987.
26. G. A. Margulis. Explicit construction of concentrator. Problems Inform. Transmission, 9:325-332, 1973.
27. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. In Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, pages 213-223, 1990.
28. V. A. Nepomnjaščiǐ. Rudimentary predicates and turing calculations. Soviet Mathematics-Doklady, 11 (6): 1462-1465, 1970.
29. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449-461, 1992.
30. N. Nisan. On read-once vs. multiple access to randomness in logspace. Theoret. Comput Sci., 107(1):135-144, 1993. Structure in complexity theory (Barcelona, 1990).
31. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
32. A. Razborov. Pseudorandom generators hard for k-dnf resolution and polynomial calculus resolution, 2002-2003. Manuscript. Available from http:// http://www.mi.ras.ru/~razborov/.
33. A. Russell and R. Sundaram. Symmetric alternation captures BPP. Comput. Complexity, 7(2): 152-162, 1998.
34. S. Sanghvi and S. Vadhan. The round complexity of two-party random selection. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 338-347, New York, NY, USA, 2005. ACM Press.
35. N. Segerlind, S. Buss, and R. Impagliazzo. A switching lemma for small restrictions and lower bounds for k-DNF resolution. SIAM J. Comput., 33(5):1171-1200 (electronic), 2004.
36. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 330-335, Boston, Massachusetts, 25-27 Apr. 1983.
37. L. Stockmeyer. On approximation algorithms for #P. SIAM J on Computing, 14(4):849-861, Nov. 1985.
38. D. van Melkebeek. Time-space lower bounds for npcomplete problems. In Current Trends in Theoretical Computer Science, pages 265-291. World Scientific, 2004.
39. D. van Melkebeek and R. Raz. A time lower bound for satisfiability. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pages 971-982, 2004.
40. E. Viola. The Complexity of Hardness Amplification and Derandomization. PhD thesis, Harvard University, 2006. http://www.eccc.uni- trier.de/eccc.