Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A characterization of tree-like Resolution size
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4003-3168
2013 (English)In: Information Processing Letters, ISSN 0020-0190, E-ISSN 1872-6119, Vol. 113, no 18, p. 666-671Article in journal (Refereed) Published
Abstract [en]

We explain an asymmetric Prover-Delayer game which precisely characterizes proof size in tree-like Resolution. This game was previously described in a parameterized complexity context to show lower bounds for parameterized formulas (Beyersdorff et al. (2013) [2]) and for the classical pigeonhole principle (Beyersdorff et al. (2010) [1]). The main point of this note is to show that the asymmetric game in fact characterizes tree-like Resolution proof size, i.e. in principle our proof method allows to always achieve the optimal lower bounds. This is in contrast with previous techniques described in the literature. We also provide a very intuitive information-theoretic interpretation of the game.

Place, publisher, year, edition, pages
2013. Vol. 113, no 18, p. 666-671
Keywords [en]
Computational complexity, Proof complexity, Prover-Delayer games, Resolution
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-127469DOI: 10.1016/j.ipl.2013.06.002ISI: 000322610700005Scopus ID: 2-s2.0-84879377601OAI: oai:DiVA.org:kth-127469DiVA, id: diva2:645732
Note

QC 20130905

Available from: 2013-09-05 Created: 2013-08-30 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Lauria, Massimo

Search in DiVA

By author/editor
Lauria, Massimo
By organisation
Theoretical Computer Science, TCS
In the same journal
Information Processing Letters
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 68 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf