004 Datenverarbeitung; Informatik
Refine
Has Fulltext
- yes (1)
Is part of the Bibliography
- yes (1)
Year of publication
- 1998 (1)
Document Type
- Doctoral Thesis (1)
Language
- English (1)
Keywords
- Komplexitätsklasse (1)
- Komplexitätstheorie (1)
- Operator (1)
- Quantor (1)
Institute
Schriftenreihe
Operators of Higher Order
(1998)
Motivated by results on interactive proof systems we investigate the computational power of quantifiers applied to well-known complexity classes.
In special, we are interested in existential, universal and probabilistic bounded error quantifiers ranging over words and sets of words, i.e. oracles if we think in a Turing machine model.
In addition to the standard oracle access mechanism, we also consider quantifiers ranging over oracles to which access is restricted in a certain way.