The polynomial hierarchy can be defined in exact analogy to the arithmetic hierarchy of computability theory, but it is not known if the polynomial hierarchy is a strict hierarchy of language classes. In fact, under certain assumptions about the class NP, this hierarchy “collapses.”
KeywordsSatisfying Assignment Existential Quantifier Output Gate Polynomial Hierarchy Inclusion Structure
Unable to display preview. Download preview PDF.
- R.M. Karp, R.J. Lipton: Some connections between nonuniform and uniform complexity classes, Proceedings of the 12th Symposium on Theory of Computer Science, ACM, 1980, 302-309.Google Scholar
- N.H. Bshouty, R. Cleve, S. Kannan, C. Tamon: Oracles and queries that are sufficient for exact learning, COLT 1994.Google Scholar
- R. Chang, J. Kadin: The Boolean hierarchy and the polynomial hierarchy: a closer connection, Proceedings of the Structure in Complexity Theory Conference, IEEE, 1990, 169-178.Google Scholar