A new characterization of ACC0 and probabilistic CC0

Computational Complexity

Volumn 19, Issue 2, 2010, Pages 211-234

  Hansen, Kristoffer Arnsfelt ^a   Koucký, Michal ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

AND function; Boolean circuits; Branching programs; Modular counting; Planarity; Probabilistic circuits

Indexed keywords

EID: 77953538534     PISSN: 10163328     EISSN: 14208954     Source Type: Journal    
DOI: 10.1007/s00037-010-0287-z     Document Type: Article

References (52)

1. 1-formulae on finite structures. Annals of Pure and Applied Logic 24(1),1-48.
2. M. Ajtai (1993). Approximate counting with uniform constant depth circuits. In Advances in Computational Complexity Theory, J.-Y Cai, editor, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1-20. American Mathematical Society.
3. M. Ajtai & M. Ben-Or (1984). A theorem on probabilistic constant depth Computations. In Proceedings of the Sixteenth Annual ACM Symposium on the Theory of Computing, Washington DC, 471-474. ACM Press.
4. M. Ajtai, J. Komlós & E. Szemerédi (1987). Deterministic simulation in LOGSPACE. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, New York, 132-140. ACM Press.
5. E. Allender & U. Hertrampf (1994). Depth reduction for circuits of unbounded fan-in. Information and Computation 112(2), 217-238.
6. E. Allender, J. Jiao, M. Mahajan & V. Vinay (1998). Non-Commutative arithmetic circuits: depth reduction and size lower bounds. Theoretical Computer Science 209(1-2), 47-86.
7. E. Allender & M. Koucký (2008). Amplifying lower bounds by means of selfreducibility. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 31-40. IEEE Computer Society Press.
8. N. Alon, U. Feige, A. Wigderson & D. Zuckerman (1995). Derandomized graph products. computational complexity 5(1), 60-75.
9. N. Alon & J. Spencer (2000). The Probabilistic Method. John Wiley & Sons, 2nd edition. ISBN 0-471-37046-0.
10. S. Arora & B. Barak (2009). Computational Complexity: A Modern Approach. Cambridge University Press.
11. 1. Journal of Computer and System Sciences 38(1), 150-164.
12. D. A. Mix Barrington (1992). Some problems involving Razborov-Smolensky polynomials. In Boolean Function Complexity, M. S. Paterson, editor, volume 169 of London Mathematical Society Lecture Note Series, 109-128. Cambridge University Press.
13. D. A. Mix Barrington, R. Beigel & S. Rudich (1994). Representing Boolean functions as polynomials modulo composite numbers. computational complexity 4, 367-382.
14. 1. Journal of Computer and System Sciences 41(3), 274-306.
15. 0 hierarchy. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, 73-83. Springer-Verlag.
16. D. A. Mix Barrington, C.-J. Lu, P. Bro Miltersen & S. Skyum (1999). On monotone planar circuits. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 24-31. IEEE Computer Society Press.
17. D. A. Mix Barrington, H. Straubing & D. Thérien (1990b). Non-uniform automata over groups. Information and Computation 89(2), 109-132.
18. 1. Journal of the ACM 35(4), 941-952.
19. R. Beigel & J. Tarui (1994). On ACC. computational complexity 4(4), 350-366.
20. J. L. Carter & M. N. Wegman (1979). Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143-154.
21. H. Caussinus (1996). A note on a theorem of Barrington, Straubing and Thérien. Information Processing Letters 58(1), 31-33.
22. S. Chari, P. Rohatgi & A. Srinivasan (1993). Randomness-optimal unique element isolation with applications to perfect matching and related problems. In Proceedings of the Twenty-fifth Annual ACM Symposium on the Theory of Computing, San Diego CA, 458-467. ACM Press.
23. K. Efremenko (2009). 3-query locally decodable codes of subexponential length. In Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, Bethesda, Maryland, USA, 39-44.
24. M. Furst, J. B. Saxe & M. Sipser (1984). Parity, circuits, and the polynomialtime hierarchy. Mathematical Systems Theory 17(1), 13-27.
25. O. Gabber & Z. Galil (1981). Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences 22(3), 407-420.
26. V. Grolmusz (2000). Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs. Combinatorica 20(1), 71-86.
27. 0. Theory of Computing Systems 39(1), 79-92.
28. K. A. Hansen (2006b). On modular counting with polynomials. In Proceedings of the 21st Annual IEEE Conference on Computational Complexity, 202-212. IEEE Computer Society Press.
29. 0 in quasipolynomial size. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 92-99. IEEE Computer Society Press.
30. K. A. Hansen, P. Bro Miltersen & V. Vinay (2006). Circuits on cylinders. computational complexity 15(1), 62-81.
31. J. Håstad (1987). Computational Limitations of Small-depth Circuits. MIT Press. ISBN 0262081679.
32. S. Hoory, N. Linial & A. Wigderson (2006). Expander graphs and their applications. Bulletin of the American Mathematical Society 43, 439-561.
33. R. Impagliazzo & D. Zuckerman (1989). How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park NC, 248-253. IEEE Computer Society Press.
34. M. Koucký (2009). Circuit complexity of regular languages. Theory of Computing Systems 45(4), 865-879.
35. M. Koucký, P. Pudlák & D. Thérien (2005). Bounded-depth circuits: separating wires from gates. In Proceedings of the Thirty-seventh Annual ACM Symposium on the Theory of Computing, Baltimore, Maryland, USA, 257-265. ACM Press.
36. M. Krause & S. Waack (1995). Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in. Mathematical Systems Theory 28(6), 553-564.
37. C. Lautemann (1983). BPP and the polynomial hierarchy. Information Processing Letters 17(4), 215-217.
38. G. A. Margulis (1973). Explicit constructions of expanders. Problemy Peredači Informacii 9(4), 71-80.
39. N. Nisan (1992). Pseudorandom generators for space-bounded computation. Combinatorica 12(4), 449-461.
40. A. A. Razborov (1987). Lower bounds for the size of circuits of bounded depth with basis (∧, ⊕). Mathematical Notes of the Academy of Science of the USSR 41(4), 333-338.
41. W. L. Ruzzo (1981). On uniform circuit complexity. Journal of Computer and System Sciences 22(3), 365-383.
42. R. Smolensky (1987). Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the Nineteenth Annual ACM Symposium on the Theory of Computing, New York, 77-82. ACM Press.
43. R. Smolensky (1990). On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis MO, 628-631. IEEE Computer Society Press.
44. H. Straubing (1994). Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser Verlag.
45. H. Straubing & D. Thérien (2006). A note on MODp - MODm circuits. Theory of Computing Systems 39(5), 699-706.
46. 0 functions and the polynomial-time hierarchy. Theoretical Computer Science 113(1), 167-183.
47. D. Thérien (1994). Circuits constructed with MODq gates cannot compute And in sublinear size. computational complexity 4, 383-388.
48. L. G. Valiant & V. V. Vazirani (1985). NP is as easy as detecting unique solutions. In Proceedings of the Seventeenth Annual ACM Symposium on the Theory of Computing, Providence RI, 458-463. ACM Press.
49. V. Vinay (1996). Hierarchies of circuit classes that are closed under complement. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 108-117. IEEE Computer Society Press.
50. E. Viola (2007). On approximate majority and probabilistic time. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, 155-168. IEEE Computer Society Press.
51. H. Vollmer (1999). Introduction to Circuit Complexity. Springer-Verlag.
52. A. C.-C. Yao (1985). Separating the polynomial-time hierarchy by oracles. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, Portland OR, 1-10.