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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
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
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
  • B. Halvarsson
  • 2008
  • Corpus ID: 19280094
In this paper different interaction measures are reviewed and compared. In particular, the two Gramian based interaction measures… 
2007
2007
The problem of managing and querying inconsistent databases has been deeply investigated in the last few years. As the problem of… 
2001
2001
Speedups of coupled processor-FPGA systems over traditional microprocessor systems are limited by the cost of hardware… 
1998
1998
Motivated by results on interactive proof systems we investigate an ∃‐∀hierarchy over P using word quantifiers as well as two… 
1994
1994
We study FP||NP , the class of functions that can be computed in polynomial time with nonadaptive queries to an NP oracle. This… 
1981
1981
We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this…