Sciweavers

6 search results - page 1 / 2
» Tree Resolution Proofs of the Weak Pigeon-Hole Principle
Sort
View
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 3 months ago
Resolution lower bounds for the weak pigeonhole principle
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).
Ran Raz
COCO
2001
Springer
94views Algorithms» more  COCO 2001»
13 years 8 months ago
Tree Resolution Proofs of the Weak Pigeon-Hole Principle
Stefan S. Dantchev, Søren Riis
ICALP
2001
Springer
13 years 8 months ago
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
ICTAC
2004
Springer
13 years 9 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
LICS
2003
IEEE
13 years 9 months ago
Polynomial-time Algorithms from Ineffective Proofs
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
Paulo Oliva