• DocumentCode
    1632286
  • Title

    Resolution lower bounds for the weak pigeon hole principle

  • Author

    Raz, Ran

  • Author_Institution
    Dept. of Comput. Sci., Weizmann Inst. of Sci., Rehovot
  • fYear
    2002
  • fDate
    6/24/1905 12:00:00 AM
  • Firstpage
    3
  • Lastpage
    3
  • Abstract
    We prove that any resolution proof for the weak pigeonhole principle, with n holes and any number of pigeons, is of length Ω(2n∈), (for some constant ∈ > 0). One corollary is that a certain propositional formulation of the statement NP ⊄ P/poly does not have short resolution proofs
  • Keywords
    combinatorial mathematics; computational complexity; theorem proving; propositional formulation; resolution lower bounds; weak pigeonhole principle; Computational complexity; Computer aided software engineering; Computer science; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
  • Conference_Location
    Montreal, Que.
  • ISSN
    1093-0159
  • Print_ISBN
    0-7695-1468-5
  • Type

    conf

  • DOI
    10.1109/CCC.2002.1004322
  • Filename
    1004322
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1632286