Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
STOC
2002
ACM
favorite
Email
discuss
report
80
views
Algorithms
»
more
STOC 2002
»
Resolution lower bounds for the weak pigeonhole principle
15 years 7 days 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
Real-time Traffic
Algorithms
|
STOC 2002
|
Weak Pigeon Hole
|
claim paper
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2002
Where
STOC
Authors
Ran Raz
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision