Search Sciweavers | Sciweavers

16 search results - page 1 / 4

» Resolution and the Weak Pigeonhole Principle

click to vote

STOC
2001
ACM

116views Algorithms» more STOC 2001»

Regular resolution lower bounds for the weak pigeonhole principle

14 years 5 months ago

Download www.cs.helsinki.fi

Toniann Pitassi, Ran Raz

claim paper

Read More »

click to vote

ICALP
2001
Springer

87views Programming Languages» more ICALP 2001»

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

13 years 9 months ago

Download www.lsi.upc.es

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...

claim paper

Read More »

click to vote

STOC
2002
ACM

80views Algorithms» more STOC 2002»

Resolution lower bounds for the weak pigeonhole principle

14 years 5 months ago

Download www.cs.helsinki.fi

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

claim paper

Read More »

click to vote

CSL
1997
Springer

88views Automated Reasoning» more CSL 1997»

Resolution and the Weak Pigeonhole Principle

13 years 9 months ago

Download euclid.ucsd.edu

Samuel R. Buss, Toniann Pitassi

claim paper

Read More »