• DocumentCode
    2775353
  • Title

    A characterization of #P by arithmetic straight line programs

  • Author

    Babai, László ; Fortnow, Lance

  • Author_Institution
    Chicago Univ., IL, USA
  • fYear
    1990
  • fDate
    22-24 Oct 1990
  • Firstpage
    26
  • Abstract
    #P functions are characterized by certain straight-line programs of multivariate polynomials. The power of this characterization is illustrated by a number of consequences. These include a somewhat simplified proof of S. Toda´s (1989) theorem that PH⊆P#P, as well as an infinite class of potentially inequivalent checkable functions
  • Keywords
    computational complexity; polynomials; programming theory; #P functions; arithmetic straight line programs; inequivalent checkable functions; infinite class; multivariate polynomials; Arithmetic; Computer aided instruction; Input variables; Polynomials; Wire;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    0-8186-2082-X
  • Type

    conf

  • DOI
    10.1109/FSCS.1990.89521
  • Filename
    89521
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2775353