Non-uniform ACC circuit lower bounds

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 115-125

  Williams, Ryan ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY CONSTANTS; CIRCUIT LOWER BOUNDS; CIRCUIT SATISFIABILITY; LOWER BOUNDS; NATURAL FUNCTIONS; POLYNOMIAL SIZE; QUASIPOLYNOMIALS;

ALGORITHMS; POLYNOMIALS;

COMPUTATIONAL COMPLEXITY;

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

References (57)

1. S. Aaronson, A. Wigderson. Algebrization: A New Barrier in Complexity Theory. TOCT 1(1), 2009.
2. M. Agrawal, E. Allender, and S. Datta. On TC0, AC0, and arithmetic circuits. JCSS 60(2):395-421, 2000.
3. 1-formulae on finite structures. Annals of Pure and Applied Logic 24:1-148, 1983.
4. E. Allender. The permanent requires large uniform threshold circuits. Chicago J. Theor. Comput. Sci., 1999.
5. N. Alon and R. B. Boppana. The monotone circuit complexity of boolean functions. Combinatorica 7(1):1-22, 1987.
6. S. Arora and B. Barak. Computational Complexity - a modern approach. Cambridge University Press, 2009.
7. E. Allender and V. Gore. A uniform circuit lower bound for the permanent. SIAM J. Comput. 23(5):1026-1049, 1994.
8. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential simulations unless EXPTIME has publishable proofs. Comp. Compl. 3:307-318, 1993.
9. T. P. Baker, J. Gill, and R. Solovay. Relativizations of the P =? NP Question. SIAM J. Comput. 4(4):431-442, 1975.
10. D. A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. JCSS 38:150-164, 1989. See also STOC'86.
11. D. A. Mix Barrington and D. Thérien. Finite monoids and the fine structure of NC1. JACM 35:941-952, 1988.
12. D. A. Mix Barrington and H. Straubing. Superlinear lower bounds for bounded-width branching programs. JCSS 50:374-381, 1995.
13. D. A. Mix Barrington, H. Straubing, and D. Thérien. Non-uniform automata over groups. Inf. and Comput. 89:109-132, 1990.
14. R. Beigel and J. Tarui. On ACC. Comput. Compl. 4:350-366, 1994. See also FOCS'91.
15. H. Buhrman, L. Fortnow, and T. Thierauf. Nonrelativizing separations. In IEEE CCC, 8-12, 1998.
16. C. Calabro, R. Impagliazzo, and R. Paturi. A duality between clause width and clause density for SAT. In IEEE CCC, 252-260, 2006.
17. C. Calabro, R. Impagliazzo, and R. Paturi. The complexity of satisfiability of small depth circuits. In IPEC, 2009.
18. H. Caussinus. A note on a theorem of Barrington, Straubing, and Thérien. IPL 58(1):31-33, 1996. (Pubitemid 126407343)
19. A. Chattopadhyay, N. Goyal, P. Pudlák, and D. Thérien. Lower bounds for circuits with MODm gates. In IEEE FOCS, 709-718, 2006. (Pubitemid 351175558)
20. A. Chattopadhyay and A. Wigderson. Linear systems over composite moduli. In IEEE FOCS, 43-52, 2009.
21. S. A. Cook. Short propositional formulas represent non-deterministic computations. IPL 26(5):269-270, 1988.
22. E. Dantsin and E. A. Hirsch. Worst-case upper bounds. In Handbook of Satisfiability, A. Biere, M. Heule, H. van Maaren and T. Walsh (eds.), 341-362, 2008.
23. L. Fortnow, R. Lipton, D. van Melkebeek, and A. Viglas. Time-space lower bounds for satisfiability. JACM 52(6):835-865, 2005. (Pubitemid 43906505)
24. M. Furst, J. Saxe, and M. Sipser. Parity, circuits, and the polynomial time hierarchy. Math. Syst. Theory 17:13-27, 1984. Also in FOCS'81.
25. Y. Gurevich and S. Shelah. Nearly linear time. Logic at Botik '89, Springer-Verlag LNCS 363, 108-118, 1989.
26. F. Green. Lower bounds for depth-three circuits with equals and mod-gates. In STACS, LNCS 900:71-82, 1995.
27. F. Green, J. Köbler, K. W. Regan, T. Schwentick, and J. Torán. The power of the middle bit of a #P function. JCSS 50(3):456-467, 1995.
28. V. Grolmusz. A lower bound for depth-3 circuits with MOD m gates. IPL 67(2):87-90, 1998. (Pubitemid 128401906)
29. V. Grolmusz and G. Tardos. Lower bounds for (MODp-MODm) circuits. SIAM J. Comput. 29(4):1209-1222, 2000.
30. K. A. Hansen. Constant width planar computation characterizes ACC0. Theory of Comput. Systems 39(1):79-92, 2006. (Pubitemid 43099532)
31. J. Håstad. Almost optimal lower bounds for small depth circuits. Adv. in Computing Research 5:143-170, 1989. See also STOC'86.
32. R. Impagliazzo, V. Kabanets, and A. Wigderson. In search of an easy witness: exponential time versus probabilistic polynomial time. JCSS 65(4):672-694, 2002. (Pubitemid 41161945)
33. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Compl. 13(1-2):1-46, 2004. (Pubitemid 41217703)
34. R. Kannan. Circuit-size lower bounds and non-reducibility to sparse sets. Inf. and Control 55(1-3):40-56, 1982.
35. A. Klivans and D. van Melkebeek. Graph nonisomor-phism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM J. Computing 31(5):1501-1526, 2002. Also in STOC'99. (Pubitemid 35298409)
36. M. Koucky and K. A. Hansen. A new characterization of ACC0 and probabilistic CC0. Comput. Compl. 19(2):211-234, 2010.
37. M. Krause and P. Pudlák. On the computational power of depth 2 circuits with threshold and modulo gates. In ACM STOC, 48-57, 1994.
38. P. B. Miltersen, N. V. Vinodchandran, and O. Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In COCOON, Springer LNCS 1627:210-220, 1999.
39. C. H. Papadimitriou and M. Yannakakis. A note on succinct representations of graphs. Inf. and Control 71:181-185, 1986.
40. W. J. Paul and R. Reischuk. On Time versus Space II. JCSS 22(3):312-327, 1981.
41. A. A. Razborov. Lower bounds on the monotone complexity of some boolean functions. Doklady Akademii Nauk SSSR 281(4):798-801, 1985.
42. A. A. Razborov. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Matematicheskie Zametki 41(4):598-607, 1987.
43. A. A. Razborov. On the method of approximations. In ACM STOC, 169-176, 1989.
44. A. A. Razborov and S. Rudich. Natural Proofs. JCSS 55(1):24-35, 1997. (Pubitemid 127433391)
45. J. M. Robson. An O(T log T) Reduction from RAM Computations to Satisfiability. Theor. Comput. Sci. 82(1):141-149, 1991. (Pubitemid 21683888)
46. R. Santhanam. Fighting perebor: new and improved algorithms for formula and QBF satisfiability. In IEEE FOCS, 183-192, 2010.
47. C.-P. Schnorr. Satisfiability is quasilinear complete in NQL. J. ACM 25(1):136-145, 1978.
48. R. Schuler. An algorithm for the satisfiability problem of formulas in conjunctive normal form. J. Algorithms 54(1):40-44, 2005.
49. J. Seiferas, M. J. Fischer, and A. Meyer. Separating nondeterministic time complexity Classes. JACM 25:146-167, 1978.
50. R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In ACM STOC, 77-82, 1987. (Pubitemid 18643393)
51. D. Thérien. Circuits constructed with MODq gates cannot compute AND in sublinear size. Comput. Compl. 4:383-388, 1994.
52. I. Tourlakis. Time-space tradeoffs for SAT on nonuniform machines. JCSS 63(2):268-287, 2001. (Pubitemid 33587679)
53. R. Williams. Improving exhaustive search implies super-polynomial lower bounds. In ACM STOC, 231-240, 2010.
54. A. C.-C. Yao. Separating the polynomial-time hierarchy by oracles. In IEEE FOCS, 1-10, 1985.
55. A. C.-C. Yao. On ACC and threshold circuits. In IEEE FOCS, 619-627, 1990.
56. P. Y. Yan and I. Parberry. Exponential size lower bounds for some depth three circuits. Inf. and Comput. 112:117-130, 1994.
57. S. Zak. A Turing machine hierarchy. TCS 26:327-333, 1983.