Title :
On operators of higher types
Author :
Vollmer, Heribert ; Wagner, Klaus W.
Author_Institution :
Wurzburg Univ., Germany
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;
Conference_Titel :
Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference)
Conference_Location :
Ulm
Print_ISBN :
0-8186-7907-7
DOI :
10.1109/CCC.1997.612313
