Operators of Higher Order

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...

Full description

Bibliographic Details
Main Author: Baier, Herbert
Format: Doctoral Thesis
Language:English
Published: 1998
Subjects:
Online Access:https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/14079
http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-140799
https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-140799
https://opus.bibliothek.uni-wuerzburg.de/files/14079/Dissertation_Baier_Herbert_1998.pdf