SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-191754"
 

Search: onr:"swepub:oai:DiVA.org:kth-191754" > Narrow Proofs May B...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Narrow Proofs May Be Maximally Long

Atserias, Albert (author)
Lauria, Massimo (author)
Nordström, Jakob (author)
KTH,Teoretisk datalogi, TCS
 (creator_code:org_t)
2016-05-18
2016
English.
In: ACM Transactions on Computational Logic. - : Association for Computing Machinery (ACM). - 1529-3785 .- 1557-945X. ; 17:3
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n(Omega(w)). This shows that the simple counting argument that any formula refutable in width w must have a proof in size n(O(w)) is essentially tight. Moreover, our lower bound generalizes to polynomial calculus resolution and Sherali-Adams, implying that the corresponding size upper bounds in terms of degree and rank are tight as well. The lower bound does not extend all the way to Lasserre, however, since we show that there the formulas we study have proofs of constant rank and size polynomial in both n and w.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Annan data- och informationsvetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Other Computer and Information Science (hsv//eng)

Keyword

Proof complexity
resolution
width
polynomial calculus
polynomial calculus resolution
PCR
Sherali-Adams
SAR
degree

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Find more in SwePub

By the author/editor
Atserias, Albert
Lauria, Massimo
Nordström, Jakob
About the subject
NATURAL SCIENCES
NATURAL SCIENCES
and Computer and Inf ...
and Other Computer a ...
Articles in the publication
ACM Transactions ...
By the university
Royal Institute of Technology

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view