With probability one, a random oracle separates PSPACE from the polynomial time hierarchy:

We consider how much error a fixed depth Boolean circuit has to make for computing the parity function. We show that with an exponential bound of the form

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Cai, Jin-Yi (VerfasserIn)
Format: Buch
Sprache:English
Veröffentlicht: Ithaca, New York 1985
Schriftenreihe:Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 715
Schlagworte:
Zusammenfassung:We consider how much error a fixed depth Boolean circuit has to make for computing the parity function. We show that with an exponential bound of the form
Beschreibung:18 S.

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!