Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

COCO
2001
Springer

favoriteEmaildiscussreport

94views Algorithms» more COCO 2001»

Tree Resolution Proofs of the Weak Pigeon-Hole Principle

13 years 8 months ago

Tree Resolution Proofs of the Weak Pigeon-Hole Principle

Download www.eecs.qmul.ac.uk

Stefan S. Dantchev, Søren Riis

Real-time Traffic

Algorithms | COCO 2001 |

claim paper

Related Content

» Resolution lower bounds for the weak pigeonhole principle

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» A Proof of Weak Termination Providing the Right Way to Terminate

» Polynomialtime Algorithms from Ineffective Proofs

» A probabilistic model for the evolution of RNA structure

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	COCO
Authors	Stefan S. Dantchev, Søren Riis

Comments (0)