Skip to search formSkip to main contentSkip to account menu

Polynomial hierarchy

Known as: Polynomial time hierarchy, Polynomial-time hierarchy 
In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
AC0Analytical hierarchyArthur–Merlin protocolBelief revision

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Lift-and-Project Methods for Set Cover and Knapsack
We study the applicability of lift-and-project methods to the Set Cover and Knapsack problems. Inspired by recent work of Karlin… 
2011
2011
Functional Magnetic Resonance Imaging: An Improved Short Record Signal Model
The number of measurement problems for which it is either difficult or expensive to obtain long measurement records is rising… 
Highly Cited
2009
Highly Cited
2009
Polynomial Semantic Indexing
We present a class of nonlinear (polynomial) models that are discriminatively trained to directly map from the word content in a… 
2008
2008
The Relational Polynomial-Time Hierarchy and Second-Order Logic
We explore the connection between the concept of relational complexity introduced by S. Abiteboul, M. Vardi and V. Vianu and the… 
Review
2008
Review
2008
Comparison of some Gramian based interaction measures
  • B. Halvarsson
  • IEEE International Conference on Computer-Aided…
  • 2008
  • Corpus ID: 19280094
In this paper different interaction measures are reviewed and compared. In particular, the two Gramian based interaction measures… 
2001
2001
Configuration Caching and Swapping
Speedups of coupled processor-FPGA systems over traditional microprocessor systems are limited by the cost of hardware… 
1998
1998
On boolean lowness and boolean highness
1996
1996
Functions Computable with Limited Access to NP
1988
1988
Restricted Turing Reducibilities & the Structure of the Polynomial Time Hierarchy
The polynomial time many-one and Turing reducibilities, Karp and Cook reducibilities respectively, play a major role in… 
1981
1981
The complexity of distributed concurrency control
We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)