A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover

A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games

Published:2010-11 Issue:23 Volume:110 Page:1074-1077
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Beyersdorff Olaf,Galesi Nicola,Lauria Massimo

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference12 articles.

1. A combinatorial characterization of resolution width;Atserias;Journal of Computer and System Sciences,2008

2. Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Hardness of parameterized resolution, Technical Report TR10-059, Electronic Colloquium on Computational Complexity, 2010.

3. Near optimal separation of tree-like and general resolution;Ben-Sasson;Combinatorica,2004

4. Stefan S. Dantchev, Barnaby Martin, Stefan Szeider, Parameterized proof complexity, In: Proc. 48th IEEE Symposium on the Foundations of Computer Science, 2007, pp. 150–160.

5. Stefan S. Dantchev, Søren Riis, Tree resolution proofs of the weak pigeon-hole principle, In: Proc. 16th Annual IEEE Conference on Computational Complexity, 2001, pp. 69–75.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof Complexity and the Binary Encoding of Combinatorial Principles;SIAM Journal on Computing;2024-06-24

2. Bounded-depth Frege complexity of Tseitin formulas for all graphs;Annals of Pure and Applied Logic;2023-01

3. Chapter 31. Quantified Boolean Formulas;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. New Resolution-Based QBF Calculi and Their Proof Complexity;ACM Transactions on Computation Theory;2019-09-17

5. A game characterisation of tree-like Q-Resolution size;Journal of Computer and System Sciences;2019-09