Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection

The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection

File(s)
89-1008.ps (291.53 KB)
89-1008.pdf (1.44 MB)
Permanent Link(s)
https://hdl.handle.net/1813/6808
Collections
Computer Science Technical Reports
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
Keywords
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

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance