Randomness, relativizations, and polynomial reducibilities
Proc. of the conference on Structure in complexity theory
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Probalisitic complexity classes and lowness
Journal of Computer and System Sciences
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Some observations on separating complexity classes
SIAM Journal on Computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Journal of the ACM (JACM)
On read-once vs. multiple access to randomness in logspace
Theoretical Computer Science - Special issue on structure in complexity theory
Journal of Computer and System Sciences
An observation on probability versus randomness with applications to complexity classes
Mathematical Systems Theory
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Complexity Classes of Alternating Machines with Oracles
Proceedings of the 10th Colloquium on Automata, Languages and Programming
On Type-2 Probabilistic Quantifiers
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Transparent (Holographic) Proofs
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
| Hi-index | 0.00 |
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.