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

Saved in:
Bibliographic Details
Main Author: Cai, Jin-Yi (Author)
Format: Book
Language:English
Published: Ithaca, New York 1985
Series:Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 715
Subjects:
Summary: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
Physical Description:18 S.

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection!