On the constant-depth complexity of k-clique

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 721-730

  Rossman, Benjamin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bounded variable hierarchy; Circuit complexity; Constant depth circuits; First order logic; K clique

Indexed keywords

FORMAL LOGIC; GRAPH THEORY;

BOUNDED VARIABLE HIERARCHY; CIRCUIT COMPLEXITY; CONSTANT-DEPTH CIRCUITS; FIRST ORDER LOGIC; K-CLIQUE;

COMPUTER CIRCUITS;

EID: 57049173496     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374480     Document Type: Conference Paper

References (29)

1. 1 formulae on finite structures. Annals of Pure and Applied Logic, 24:1-48. 1983.
2. M. Ajtai. First-order definability on finite structures. Ann. Pure Appl. Logic, 45(3):211-225, 1989.
3. N. Alon and R. B. Boppana. The monotone circuit complexity of boolean functions. Cornbinatorica, 7(l):l-22, 1987.
4. N. Alon and J. Spencer. The Probabilistic Method. John Wiley, 1992.
5. K. Amano and A. Maruoka. A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates. SIAM J., Comput, 35(1):201-215, 2005.
6. 1. Journal of Computer and System Sciences, 41(3):274-306, 1990.
7. P. Beame. Lower bounds for recognizing small cliques on GROW PRAM's. Discrete Appl. Math., 29(l):3-20, 1990.
8. P. Beame. A switching lemma primer. Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington, November 1994.
9. R. B. Boppana. The average sensitivity of bounded-depth circuits. Inf. Process. Lett., 63(5):257-261, 1997.
10. A. Dawar. How many first-order variables are needed on finite ordered structures? In We Will Show Them: Essays in Honour of Dov Gabbay, pages 489-520, 2005.
11. L. Denenberg, Y. Gurevich, and S. Shelah. Definability by constant-depth polynomial-size circuits. Information and Control, 70(2/3):216-240, 1986.
12. M. L. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17:13-27, 1984.
13. M. Goldmann and J. Håstad. A simple lower bound for the depth of monotone circuits computing clique using a communication game. Information Processing Letters, 41(4):221-226, 1992.
14. M. Grohe. Finite variable logics in descriptive complexity theory. Bulletin of Symbolic Logic, 4(4):345-398, 1998.
15. J. Håstad. Almost optimal lower bounds for small depth circuits. In STOC '86: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 6-20, 1986.
16. N. Immerman. Upper and lower bounds for first order expressibility. J. Cornput. Syst. Set., 25(1):76-98, 1982.
17. N. Immerman. Expressibility and parallel complexity. SIAM J. Cornput., 18(3):625-638, 1989.
18. N. Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer-Verlag, New York, 1999.
19. S. Janson. Poisson approximation for large deviations. Random Struct. Algorithms, l(2):221-230, 1990.
20. S. Janson, T. Luczak, and A. Rucinski. An exponential bound for the probability of nonexistence of a specified subgraph in a random graph. In Random Graphs '87, pages 73-87, 1990.
21. M. Koucky, C. Lautemann, S. Poloczek, and D. Therien. Circuit lower bounds via, Ehrenfeucht-Fraisse games. In CCC '06: Proceedings of the. 21st Annual IEEE Conference on Computational Complexity, pages 190-201, 2006.
22. L. Libkin. Elements of Finite Model Theory. Springer-Verlag, 2004.
23. J. F. Lynch. A depth-size tradeoff for boolean circuits with unbounded fan-in. In Structure in Complexity Theory Conference, pages 234-248, 1986.
24. M. Otto. Bounded variable logics and counting - A study in finite models, volume 9. Springer-Verlag, 1997.
25. B. Poizat. Deux ou trois choses que je sais de Ln. J. Symb. Log., 47(3):641-658, 1982.
26. A. A. R.azborov. Lower bounds on the monotone complexity of some boolean functions. Doklady Akademii Nauk SSSR, 281:798-801, 1985.
27. English translation in Soviet Math. Doklady 31 (1985), 354-357.
28. I. Wegener. On the complexity of branching programs and decision trees for clique functions. J. ACM, 35(2):46f-471, 1988.
29. A. C.-C. Yao. Separating the polynomial-time hierarchy by oracles. In Proc. 26th Annual Symposium on Foundations of Computer Science, pages 1-10, 1985.