The Community for Technology Leaders
21st Annual IEEE Conference on Computational Complexity (CCC'06) (2006)
Prague, Czech Republic
July 16, 2006 to July 20, 2006
ISSN: 1093-0159
ISBN: 0-7695-2596-2
pp: 190-201
Michal Koucky , Mathematical Institute, AS CR, Czech Republic
Clemens Lautemann , Johannes Gutenberg-Universitat, Germany
Sebastian Poloczek , Johannes Gutenberg-Universitat, Germany
Denis Therien , McGill University, Canada
ABSTRACT
In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable byAC0 circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC^0 circuits.
INDEX TERMS
null
CITATION

D. Therien, C. Lautemann, S. Poloczek and M. Koucky, "Circuit Lower Bounds via Ehrenfeucht-Fraisse Games," 21st Annual IEEE Conference on Computational Complexity (CCC'06)(CCC), Prague, Czech Republic, 2006, pp. 190-201.
doi:10.1109/CCC.2006.12
168 ms
(Ver 3.3 (11022016))