• DocumentCode
    2933099
  • Title

    On operators of higher types

  • Author

    Vollmer, Heribert ; Wagner, Klaus W.

  • Author_Institution
    Wurzburg Univ., Germany
  • fYear
    1997
  • fDate
    24-27 Jun 1997
  • Firstpage
    174
  • Lastpage
    184
  • Abstract
    We discuss the use of operators of higher types in complexity theory. These are operators ranging over sets of words, i.e. over oracles. Depending on different oracle access mechanisms we consider two types of operators. In particular we examine existential, universal, and bounded-error probabilistic operators. We identify some of the emerging classes and we interpret recent results about interactive protocols in terms of these operators
  • Keywords
    computational complexity; error statistics; protocols; set theory; bounded-error probability; computational complexity; higher type operators; interactive protocols; oracles; Polynomials; Protocols; Turing machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference)
  • Conference_Location
    Ulm
  • ISSN
    1093-0159
  • Print_ISBN
    0-8186-7907-7
  • Type

    conf

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