On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F11%3A00369662" target="_blank" >RIV/67985840:_____/11:00369662 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/S0219061311000979" target="_blank" >http://dx.doi.org/10.1142/S0219061311000979</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/S0219061311000979" target="_blank" >10.1142/S0219061311000979</a>
Alternative languages
Result language
angličtina
Original language name
On the proof complexity of the Nisan-Wigderson generator based on a hard NP boolean AND coNP function
Original language description
We prove the consistency of a statement generalizing Razborov's conjecture from proof complexity with the true universal theory in the language of Cook's theory PV.
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
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
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
Journal of Mathematical Logic
ISSN
0219-0613
e-ISSN
—
Volume of the periodical
11
Issue of the periodical within the volume
1
Country of publishing house
SG - SINGAPORE
Number of pages
17
Pages from-to
11-27
UT code for WoS article
000294810400002
EID of the result in the Scopus database
—