All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Total space in resolution

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F16%3A00466751" target="_blank" >RIV/67985840:_____/16:00466751 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1137/15M1023269" target="_blank" >http://dx.doi.org/10.1137/15M1023269</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1137/15M1023269" target="_blank" >10.1137/15M1023269</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Total space in resolution

  • Original language description

    We show quadratic lower bounds on the total space used in resolution refutations of random $k$-CNFs over $n$ variables and of the graph pigeonhole principle and the bit pigeonhole principle for $n$ holes. This answers the open problem of whether there are families of $k$-CNF formulas of polynomial size that require quadratic total space in resolution. The results follow from a more general theorem showing that, for formulas satisfying certain conditions, in every resolution refutation there is a memory configuration containing many clauses of large width.

  • 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

    <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

Others

  • Publication year

    2016

  • 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

    Siam Journal on Computing

  • ISSN

    0097-5397

  • e-ISSN

  • Volume of the periodical

    45

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    1894-1909

  • UT code for WoS article

    000387321500007

  • EID of the result in the Scopus database

    2-s2.0-85010644516