A REDUCTION OF PROOF COMPLEXITY TO COMPUTATIONAL COMPLEXITY FOR AC(0)[p] FREGE SYSTEMS
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10317953" target="_blank" >RIV/00216208:11320/15:10317953 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A REDUCTION OF PROOF COMPLEXITY TO COMPUTATIONAL COMPLEXITY FOR AC(0)[p] FREGE SYSTEMS
Original language description
We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so-called AC(0)[p] Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over F-p.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Name of the periodical
Proceedings of the American Mathematical Society
ISSN
0002-9939
e-ISSN
—
Volume of the periodical
143
Issue of the periodical within the volume
11
Country of publishing house
US - UNITED STATES
Number of pages
15
Pages from-to
4951-4965
UT code for WoS article
000364413000035
EID of the result in the Scopus database
2-s2.0-84940399479