Nisan-Wigderson generatos in proof systems with forms of interpolation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10105727" target="_blank" >RIV/00216208:11320/11:10105727 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/malq.201010012" target="_blank" >http://dx.doi.org/10.1002/malq.201010012</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/malq.201010012" target="_blank" >10.1002/malq.201010012</a>
Alternative languages
Result language
angličtina
Original language name
Nisan-Wigderson generatos in proof systems with forms of interpolation
Original language description
We prove that the Nisan-Wigderson generators based on computationally hard functions and suitable matrices are hard for propositional proof systems that admit feasible interpolation.
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
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
Mathematical Logic Quarterly
ISSN
0942-5616
e-ISSN
—
Volume of the periodical
57
Issue of the periodical within the volume
4
Country of publishing house
GB - UNITED KINGDOM
Number of pages
5
Pages from-to
379-383
UT code for WoS article
—
EID of the result in the Scopus database
—