Skip to main content
SpringerLink
Log in

Regular Resolution Lower Bounds For The Weak Pigeonhole Principle

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

We prove that any regular resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length \( \Omega {\left( {2^{{n^{\varepsilon } }} } \right)} \), (for some global constant ε > 0).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, 10 King’s College Road, Toronto, Ontario, M5S 3G4, Canada

    Toniann Pitassi*

  2. Department of Computer Science, Weizmann Institute, Rehovot, 76100, Israel

    Ran Raz†

Authors
  1. Toniann Pitassi*
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ran Raz†
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Toniann Pitassi*.

Additional information

* Research supported by NSF grant CCR-9820831, US-Israel BSF grant 98-00349, and an NSERC grant.

† Research supported by US-Israel BSF grant 98-00349, and NSF grant CCR-9987077.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pitassi*, T., Raz†, R. Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. Combinatorica 24, 503–524 (2004). https://doi.org/10.1007/s00493-004-0030-y

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-004-0030-y

Mathematics Subject Classification (2000):

Search

Navigation