Show simple item record

dc.contributor.authorCai, Jin-yien_US
dc.date.accessioned2007-04-23T17:16:02Z
dc.date.available2007-04-23T17:16:02Z
dc.date.issued1986-08en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR86-778en_US
dc.identifier.urihttps://hdl.handle.net/1813/6618
dc.description.abstractThis thesis is a study of separations of some complexity classes which take place in almost all relativized worlds. We achieve probability one separations of PSPACE from the Polynomial-time Hierarchy PH. Also we separate with probability one all levels of the Boolean Hierarchy BH. The study on the Boolean Hierarchy is a continuation of the work by Bennet and Gill in [BG81] and the joint work in [CH86], where we introduced the "sawing" argument. This "sawing" technique is adapted here to yield probability one separation. The study on PSPACE versus the Polynomial-time Hierarchy is more intriguing. Several novel techniques are employed here. The connection with Boolean circuit is exploited to reduce the problem to a Boolean circuit computation problem. The fixed depth unbounded fan-in Boolean circuit model is considered in connection with the parity function. We show that with an exponential bound of the form $exp(n^{\lambda}$ on the size of the circuits, they make asymptomatically 50% error on all possible inputs, uniformly. Certain probabilistic and game theoretic methods are applied extensively to conclude the result.en_US
dc.format.extent3332730 bytes
dc.format.extent716712 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleOn Some Most Probable Separations of Complexity Classesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics