A trade-off between length and width in resolution

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F16%3A00462811" target="_blank" >RIV/67985840:_____/16:00462811 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4086/toc.2016.v012a005" target="_blank" >http://dx.doi.org/10.4086/toc.2016.v012a005</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4086/toc.2016.v012a005" target="_blank" >10.4086/toc.2016.v012a005</a>

Result language
angličtina
Original language name
A trade-off between length and width in resolution
Original language description
We describe a family of CNF formulas in n variables, with small initial width, which have polynomial length resolution refutations. By a result of Ben-Sasson and Wigderson it follows that they must also have narrow resolution refutations, of width ... We show that, for our formulas, this decrease in width comes at the expense of an increase in size, and any such narrow refutations must have exponential length.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)