A Characterization of Tree-Like Resolution Size
2012 (English)In: Electronic Colloquium on Computational Complexity (ECCC), ISSN 1433-8092, no 161Article in journal (Refereed) Published
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
prover-delayer games, resolution
IdentifiersURN: urn:nbn:se:kth:diva-112884OAI: oai:DiVA.org:kth-112884DiVA: diva2:587524
QC 201305032013-01-142013-01-142013-05-03Bibliographically approved