• DocumentCode
    2116633
  • Title

    Much ado about functions

  • Author

    Selman, Alan L.

  • Author_Institution
    Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
  • fYear
    1996
  • fDate
    24-27 May 1996
  • Firstpage
    198
  • Lastpage
    212
  • Abstract
    This paper surveys basic results on complexity classes of partial multivalued functions. We stress basic inclusion relations, interesting hierarchies, and results that demonstrate that hierarchies are extant
  • Keywords
    computational complexity; multivalued logic; basic inclusion relations; complexity classes; complexity theory; data type; hierarchies; multivalued functions; partial functions; Books; Complexity theory; Computational complexity; Computer science; NP-complete problem; Polynomials; Search problems; Stress; Transducers;
  • 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.507682
  • Filename
    507682
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2116633