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.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
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… 
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… 
2007
2007
A three-valued semantics for querying and repairing inconsistent databases
The problem of managing and querying inconsistent databases has been deeply investigated in the last few years. As the problem of… 
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
The Analytic Polynomial‐Time Hierarchy
Motivated by results on interactive proof systems we investigate an ∃‐∀hierarchy over P using word quantifiers as well as two… 
1997
1997
Construction of classification trees via the classification-hierarchy table
1994
1994
Functions Computable with Nonadaptive Queries to NP
We study FP||NP , the class of functions that can be computed in polynomial time with nonadaptive queries to an NP oracle. This… 
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
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)