Simultaneous strong separations of probabilistic and unambiguous complexity classes:

Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Format: Buch
Sprache:English
Veröffentlicht: Rochester, NY 1990
Schriftenreihe:University of Rochester <Rochester, NY> / Department of Computer Science: Technical report 335
Schlagworte:
Zusammenfassung:Abstract: "We study the relationship between probabilistic and unambiguous computation, and provide strong relativized evidence that they are incomparable. In particular, we display a relativized world in which the complexity classes embodying these paradigms of computation are mutually immune. We answer questions formulated in -- and extend the line of research opened by -- Geske and Grollman [15] and Balcázar and Russo [3]."
Beschreibung:18 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!