• DocumentCode
    2117418
  • Title

    Good degree bounds on Nullstellensatz refutations of the induction principle

  • Author

    Buss, Samuel R. ; Pitassi, Toniann

  • Author_Institution
    Dept. of Math., California Univ., San Diego, La Jolla, CA, USA
  • fYear
    1996
  • fDate
    24-27 May 1996
  • Firstpage
    233
  • Lastpage
    242
  • Abstract
    This paper gives nearly optimal, logarithmic upper and lower bounds on the minimum degree of Nullstellensatz refutations (i.e., polynomials) of the propositional induction principle
  • Keywords
    computational complexity; theorem proving; Nullstellensatz refutations; degree bounds; induction principle; lower bounds; minimum degree; proof system; propositional induction principle; upper bounds; Automatic testing; Computer science; Equations; Mathematics; Polynomials; System testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
  • Conference_Location
    Philadelphia, PA
  • Print_ISBN
    0-8186-7386-9
  • Type

    conf

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