A lower bound on the size of resolution proofs of the Ramsey theorem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00377483" target="_blank" >RIV/67985840:_____/12:00377483 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2012.05.004" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2012.05.004</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2012.05.004" target="_blank" >10.1016/j.ipl.2012.05.004</a>
Alternative languages
Result language
angličtina
Original language name
A lower bound on the size of resolution proofs of the Ramsey theorem
Original language description
We prove an exponential lowerbound on the lengths of resolutionproofs of propositions expressing the finite Ramseytheorem for pairs.
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>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
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
Information Processing Letters
ISSN
0020-0190
e-ISSN
—
Volume of the periodical
112
Issue of the periodical within the volume
14-15
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
2
Pages from-to
610-611
UT code for WoS article
000305726800009
EID of the result in the Scopus database
—