Circuit lower bounds via ehrenfeucht-fraïssé games

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 2006, Issue , 2006, Pages 190-201

  Koucký, Michal ^a   Poloczek, Sebastian ^b   Lautemann, Clemens ^b   Thérien, Denis ^c  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CIRCUIT LOWER BOUNDS; FIRST ORDER FORMULAS;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; LOGIC GATES;

LOGIC CIRCUITS;

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

References (9)

1. 1-formulae on finite structures. Annals of Pure and Applied Logic, 24:1-48, 1983.
2. M. Ajtai. Approximate counting with uniform constant depth circuits. In In J.-Y Cai, ed. Advances in Computational Complexity Theory, DIMACS Series in Disc. Math. and Theoret. Comp. Sci., pages 1-20, 1993.
3. 1. Journal of Computer and System Sciences, 41(3):274-306, Dec. 1990.
4. S. Chaudhuri and J. Radhakrishnan. Deterministic restrictions in circuit complexity. In Proceedings of the 28-th annual ACM symposium on Theory of computing, pages 30-36, 1996.
5. M. Furst, J. Saxe, and M. Sipser. Parity, circuits and the polynomial time hierarchy. Mathematical Systems Theory, 17:13-27, 1984.
6. N. Immerman. Languages that capture complexity classes. SIAM J. of Computing, 16(4):760-778, 1987.
7. N. Immerman. Descriptive complexity. Springer, New York, 1999.
8. M. Koucký, P. Pudlák, and D. Thérien. Bounded-depth circuits: Separating wires from gates. In Proceedings of the 37-th annual ACM symposium on Theory of computing, pages 257-265, 2005.
9. C. Papadimitriou. Computational complexity. Addison-Wesley, New York, 1994.