Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F06%3A00041325" target="_blank" >RIV/67985840:_____/06:00041325 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Circuit Lower Bounds via Ehrenfeucht-Fraisse Games
Original language description
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 by AC0 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 AC0 circuits.
Czech name
Dolní odhady pro obvody pomocí her Ehrenfeucht a Fraisse
Czech description
Článek ukazuje dolní odhady pro obvody konstantní hloubky pomocí her Ehrenfeucht a Fraisse.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of 21st Annual IEEE Conference on Computational Complexity
ISBN
0-7695-2596-2
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
190-201
Publisher name
IEE Computer Society Press
Place of publication
New York
Event location
Praha
Event date
Jul 16, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—