The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection

Thumbnail
View/Open
PERMANENT LINK(S)
https://hdl.handle.net/1813/6808
Collections
Metadata
Show full item record
Author
Chang, Richard; Kadin, Jim
Abstract
We 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.
Date Issued
1989-05
Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1008
Type
technical report

Statistics