Tree resolution proofs of the weak pigeon-hole principle

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 69-75

  Dantchev, Stefan ^a   Riis, Søren ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; THEOREM PROVING; TREES (MATHEMATICS);

ORDINARY PIGEON-HOLE PRINCIPLE; TREE RESOLUTION PROOF; WEAK PIGEON-HOLE PRINCIPLE;

COMPUTATIONAL COMPLEXITY;

EID: 0034865449     PISSN: 10930159     EISSN: None     Source Type: Journal    
DOI: 10.1109/CCC.2001.933873     Document Type: Article

References (16)

1. Simplified and improved resolution lower bounds
2. Short proofs are narrow - resolution made simple
3. Resolution and the weak pigeonhole principle
4. Resolution proofs of generalized pigeonhole principles
5. A tough nut for tree resolution
6. The intractability of resolution
7. Tree-like resolution is super-polynomially slower than DAG-like resolution for the pigeonhole principle
8. Regular resolution lower bounds for the weak pigeonhole principle
9. Proofs as games
10. How to lie without being (easily) convicted and the lengths of proofs in propositional calculus
11. Resolution lower bounds for the weak pigeonhole principle
12. Read-once branching programs, rectangular proofs of the pigeonhole principle and transversal calculus
13. A complexity gap for tree-resolution
14. Generating hard tautologies using predicate logic and the symmetric group
15. Resolution proofs of matching principles