Change search
ReferencesLink to record
Permanent link

Direct link
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
2012 (English)In: Electronic Colloquium on Computational Complexity (ECCC), ISSN 1433-8092, no 161Article 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 [BGL11] and for the classical pigeonhole principle [BGL10]. 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
2012. no 161
Keyword [en]
prover-delayer games, resolution
National Category
Computer Science
URN: urn:nbn:se:kth:diva-112884OAI: diva2:587524

QC 20130503

Available from: 2013-01-14 Created: 2013-01-14 Last updated: 2013-05-03Bibliographically approved

Open Access in DiVA

No full text

Other links

Search in DiVA

By author/editor
Lauria, Massimo
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 38 hits
ReferencesLink to record
Permanent link

Direct link