|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6808
| Title: | The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection |
| Authors: | Chang, Richard
Kadin, Jim |
| Keywords: | computer science
technical report |
| Issue Date: | May-1989 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1008 |
| 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. |
| URI: | http://hdl.handle.net/1813/6808 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
