Amplifying lower bounds by means of self-reducibility

Journal of the ACM

Volumn 57, Issue 3, 2010, Pages

  Allender, Eric ^a   Koucký, Michal ^b  

^a RUTGERS UNIVERSITY   (United States)

^b INSTITUTE OF MATHEMATICS   (Czech Republic)

Author keywords

Circuit complexity; Lower bounds; Natural proofs; Self reducibility; Time space tradeoffs

Indexed keywords

BOOLEAN FORMULAE; CIRCUIT COMPLEXITY; CIRCUIT LOWER BOUNDS; COMPUTATIONAL PROBLEM; CONSTANT-DEPTH CIRCUITS; LOWER BOUNDS; NATURAL PROOFS; SPACE AND TIME; TIME-SPACE;

THERMAL CONDUCTIVITY;

EID: 77950344196     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1706591.1706594     Document Type: Article

References (55)

1. AGRAWAL,M. 2001. The first-order isomorphism theorem. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS). Lecture Notes in Computer Science, vol.2245. Springer-Verlag, Berlin, Germany, 70-82.
2. AGRAWAL,M.,ALLENDER, E., AND RUDICH, S. 1998. Reductions in circuit complexity: An isomorphism theorem and a gap theorem. J. Comput. Syst. Sci. 57, 127-143.
3. AJTAI, M. 1999. A non-linear time lower bound for Boolean branching programs. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 60-70.
4. ALLENDER, E. 2004. Arithmetic circuits and counting complexity classes. In Complexity of Computations and Proofs, Quaderni di Matematica, vol.13. Seconda Universit̀a di Napoli, Napoli, Italy, 33-72.
5. ALLENDER, E. 2008. Cracks in the defenses: Scouting out approaches on circuit lower bounds. In Proceedings of Computer Science - Theory and Applications (CSR 2008). Lecture Notes in Computer Science, vol.5010. Springer-Verlag, Berlin, Germany, 3-10.
6. ALLENDER, E., AND GORE, V. 1994. A uniform circuit lower bound for the permanent. SIAM J. Comput. 23, 1026-1049
7. ALLENDER, E., HELLERSTEIN, L.,MCCABE, P., PITASSI, T., AND SAKS,M. E. 2008. Minimizing disjunctive normal form formulas and AC0 circuits given a truth table. SIAM J. Comput. 38, 1, 63-84.
8. ALLENDER, E., KOUCḰY,M., RONNEBURGER, D., ROY, S., AND VINAY, V. 2001. Time-space tradeoffs in the counting hierarchy. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity (CCC). IEEE Computer Society Press, Los Alamitos, CA, 295-302.
9. ALLENDER, E., AND OGIHARA, M. 1996. Relationships among PL, #L, and the determinant. RAIRO - Theoret. Inf. Appl. 30, 1, 1-21. (Pubitemid 126603639)
10. APPLEBAUM, B., ISHAI, Y., AND KUSHILEVITZ, E. 2006. Cryptography in NC0. SIAM J. Comput. 36, 4, 845-888.
11. BARRINGTON, D. A. 1989. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 1 (Feb.), 150-164.
12. BARRINGTON, D. A. M., STRAUBING, H., AND TH́ERIEN, D. 1990a. Non-uniform automata over groups. Inf. Comput. 89, 2, 109-132.
13. BARRINGTON,D.M., IMMERMAN, N., AND STRAUBING,H. 1990b. On uniformity withinNC1. J. Comput. Syst. Sci. 41, 3 (Dec.), 274-306.
14. BEAME, P., SAKS, M., SUN, X., AND VEE, E. 2003. Super-linear time-space tradeoff lower bounds for randomized computation. J. ACM 50, 154-195.
15. BUSS, S. 1993. Algorithms for Boolean formula evaluation and for tree contraction. In Arithmetic, Proof Theory, and Computational Complexity, Oxford Logic Guides, vol.23. Oxford Science Publications, 96-115.
16. BUSS, S., COOK, S., GUPTA, A., AND RAMACHANDRAN, V. 1992. An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21, 755-780.
17. BUSS, S. R. 1987. The Boolean formula value problem is in Alogtime. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM, New York, 123-131.
18. CAUSSINUS, H., MCKENZIE, P., TH́ERIEN, D., AND VOLLMER, H. 1998. Nondeterministic NC1 computation. J. Comput. Syst. Sci. 57, 200-212.
19. CHANDRA, A. K., FORTUNE, S., AND LIPTON, R. J. 1985. Unbounded fan-in circuits and associative functions. J. Comput. Syst. Sci. 30, 2, 222-234.
20. COOK, S. A. 1985. A taxonomy of problems with fast parallel algorithms. Inf. Cont. 64, 1-3, 2-21.
21. COOK, S. A. 1988. Short propositional formulas represent nondeterministic computations. Inf. Process. Lett. 26, 5, 269-270.
22. ETESSAMI, K. 1997. Counting quantifiers, successor relations, and logarithmic space. J. Comput. Syst. Sci. 54, 3 (Jun), 400-411.
23. FEIGE, U., AND KILIAN, J. 1998. Zero knowledge and the chromatic number. J. Comput. Syst. Sci. 57, 2, 187-199.
24. FORTNOW, L. 2000. Time-space tradeoffs for satisfiability. J. Comput. Syst. Sci. 60, 336-353.
25. FURST,M., SAXE, J. B., AND SIPSER,M. 1984. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 13-27.
26. GOLDWASSER, S., GUTFREUND, D., HEALY, A., KAUFMAN, T., AND ROTHBLUM, G. N. 2007. Verifying and decoding in constant depth. In Proceedings of the ACMSymposium on Theory of Computing (STOC). ACM, New York, 440-449.
27. HÅSTAD, J. 1988. Computational Limitations of Small Depth Circuits. MIT Press, Cambridge, MA.
28. HÅSTAD, J. 1998. The shrinkage exponent of de Morgan formulas is 2. SIAM J. Comput. 27, 1, 48-64.
29. 1-ε . Acta Math. 182, 105-142.
30. HANSEN, K. A., AND KOUCḰY, M. 2010. A new characterization of ACC0 and probabilistic CC0. Computat. Complex. To appear.
31. HESSE,W., ALLENDER, E., AND BARRINGTON, D. A.M. 2002. Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65, 695-716.
32. IMPAGLIAZZO, R., PATURI, R., AND SAKS, M. E. 1997. Size-depth tradeoffs for threshold circuits. SIAM J. Comput. 26, 693-707.
33. KHOT, S. 2001. Improved inaproximability results for maxclique, chromatic number and approximate graph coloring. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 600-609.
34. KHOT, S., AND PONNUSWAMI, A. K. 2006. Better inapproximability results for maxclique, chromatic number and min-3lin-deletion. In Proceedings of the 33rd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol.4051. Springer-Verlag, Berlin, Germany, 226-237.
35. KOUCḰY, M. 2009. Circuit complexity of regular languages. Theory Comput. Syst. 45, 4, 865-879.
36. LINIAL, N.,MANSOUR, Y., AND NISAN, N. 1993. Constant depth circuits, Fourier transform, and learnability. J. ACM 40, 3, 607-620.
37. NAOR, M., AND REINGOLD, O. 2004. Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51, 2, 231-262.
38. NECIPORUK, E. I. 1966. On a Boolean function. Doklady of the Academy of Sciences of the USSR 169, 4, 765-766.
39. (English translation in Soviet Mathematics Doklady 7:4, pages 999-1000.)
40. RAZBOROV, A., AND RUDICH, S. 1997. Natural proofs. J. Comput. Syst. Sci. 55, 24-35.
41. RAZBOROV, A. A. 1987. Lower bounds on the size of bounded depth networks over a complete basis with logical addition. Mathematicheskie Zametki 41, 598-607.
42. (English translation in Mathematical Notes of the Academy of Sciences of the USSR 41:333-338, 1987.)
43. RAZBOROV, A. A. 1991. Lower bounds for deterministic and nondeterministic branching programs. In Proceedings of the Symposium on Foundations of Computation Theory. Lecture Notes in Computer Science, vol.529. Springer-Verlag, Berlin, Germany, 47-60.
44. RAZBOROV, A. A. 1995a. Bounded arithmetic and lower bounds. In Feasible Mathematics II. Progress in Computer Science and Applied Logic, vol.13. Birkhäuser, 344-386.
45. RAZBOROV, A. A. 1995b. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic. Izvestiya Math. 59, 205-227.
46. ROSSMAN,B. 2008. Onthe constant-depth complexity of k-clique. In Proceedings of theACMSymposium on Theory of Computing (STOC). ACM, New York, 721-730.
47. RUZZO, W. L. 1981. On uniform circuit complexity. J. Comput. Syst. Sci. 22, 3, 365-383.
48. SMOLENSKY, R. 1987. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM, New York, 77-82.
49. SRINIVASAN, A. 2003. On the approximability of clique and related maximization problems. J. Comput. Syst. Sci. 67, 3, 633-651.
50. VAN MELKEBEEK, D. 2004. Time-space lower bounds for NP-complete problems. In Current Trends Theoret. Computer Science, World Scientific Press, 265-291.
51. VAN MELKEBEEK, D. 2007. A survey of lower bounds for satisfiability and related problems. Found. Trends in Theoretical Comput. Sci. 2, 197-303.
52. VOLLMER, H. 1999. Introduction to Circuit Complexity. Springer-Verlag, Berlin, Germany.
53. WILSON, C. 1990. Decomposability of NC and AC. SIAM J. Comput. 19, 384-396.
54. YAO, A. C. C. 1985. Separating the polynomial-time hierarchy by oracles. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 1-10.
55. ZUCKERMAN, D. 2007. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3, 1, 103-128.