Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,321 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AC0
Analytical hierarchy
Arthur–Merlin protocol
Belief revision
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
Expand
Highly Cited
2009
Highly Cited
2009
Polynomial Semantic Indexing
Bing Bai
,
J. Weston
,
+5 authors
M. Mohri
Neural Information Processing Systems
2009
Corpus ID: 1633422
We present a class of nonlinear (polynomial) models that are discriminatively trained to directly map from the word content in a…
Expand
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…
Expand
2007
2007
A three-valued semantics for querying and repairing inconsistent databases
F. Furfaro
,
S. Greco
,
Cristian Molinaro
Annals of Mathematics and Artificial Intelligence
2007
Corpus ID: 274648
The problem of managing and querying inconsistent databases has been deeply investigated in the last few years. As the problem of…
Expand
2001
2001
Configuration Caching and Swapping
S. Sudhir
,
Suman Nath
,
S. Goldstein
International Conference on Field-Programmable…
2001
Corpus ID: 1492205
Speedups of coupled processor-FPGA systems over traditional microprocessor systems are limited by the cost of hardware…
Expand
1998
1998
The Analytic Polynomial‐Time Hierarchy
H. Baier
,
K. Wagner
Mathematical Logic Quarterly
1998
Corpus ID: 15110383
Motivated by results on interactive proof systems we investigate an ∃‐∀hierarchy over P using word quantifiers as well as two…
Expand
1997
1997
Construction of classification trees via the classification-hierarchy table
T. Chen
,
P. Poon
Information and Software Technology
1997
Corpus ID: 12141135
1994
1994
Functions Computable with Nonadaptive Queries to NP
H. Buhrman
,
Jim Kadin
,
T. Thierauf
Proceedings of IEEE 9th Annual Conference on…
1994
Corpus ID: 14541148
We study FP||NP , the class of functions that can be computed in polynomial time with nonadaptive queries to an NP oracle. This…
Expand
Highly Cited
1988
Highly Cited
1988
Parallel Approximation Algorithms for Bin Packing
Richard J. Anderson
,
E. Mayr
,
Manfred K. Warmuth
Information and Computation
1988
Corpus ID: 14934001
1981
1981
The complexity of distributed concurrency control
P. Kanellakis
,
C. Papadimitriou
22nd Annual Symposium on Foundations of Computer…
1981
Corpus ID: 10777031
We present a formal framework for distributed databases, and we study the complexity of the concurrency control problem in this…
Expand
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)
ACCEPT & CONTINUE