004 Datenverarbeitung; Informatik
Filtern
Volltext vorhanden
- ja (1)
Gehört zur Bibliographie
- ja (1)
Erscheinungsjahr
- 1998 (1)
Dokumenttyp
- Dissertation (1) (entfernen)
Sprache
- Englisch (1)
Schlagworte
- Quantor (1) (entfernen)
Institut
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.