Show simple item record

dc.contributor.authorChang, Richarden_US
dc.contributor.authorKadin, Jimen_US
dc.date.accessioned2007-04-23T17:36:33Z
dc.date.available2007-04-23T17:36:33Z
dc.date.issued1989-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1008en_US
dc.identifier.urihttps://hdl.handle.net/1813/6808
dc.description.abstractWe show that if the Boolean hierarchy collapses to its $k^{th}$ level, then the polynomial hierarchy collapses to the $k^{th}$ level of the difference hierarchy of $\Sigma^{P}_{2}$ languages.en_US
dc.format.extent1512090 bytes
dc.format.extent298526 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.titleThe Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connectionen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics