Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 206,211,513 papers from all fields of science
Search
Sign In
Create Free Account
NEXPTIME
Known as:
NEXP
In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
30 relations
2-EXPTIME
ACC0
Adjacency matrix
Algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
The Dynamic Quasiperpendicular Shock: Cluster Discoveries
V. Krasnoselskikh
,
M. Balikhin
,
+9 authors
H. Comişel
2013
Corpus ID: 56051046
The physics of collisionless shocks is a very broad topic which has been studied for more than five decades. However, there are a…
Expand
Highly Cited
2012
Highly Cited
2012
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
Tsuyoshi Ito
,
Thomas Vidick
IEEE 53rd Annual Symposium on Foundations of…
2012
Corpus ID: 7553531
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first…
Expand
Highly Cited
2010
Highly Cited
2010
Improving exhaustive search implies superpolynomial lower bounds
Ryan Williams
STOC '10
2010
Corpus ID: 651703
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable…
Expand
Highly Cited
2009
Highly Cited
2009
The Complexity of Circumscription in DLs
P. Bonatti
,
C. Lutz
,
F. Wolter
J. Artif. Intell. Res.
2009
Corpus ID: 9132519
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance…
Expand
Highly Cited
2009
Highly Cited
2009
Algebrization: A New Barrier in Complexity Theory
S. Aaronson
,
A. Wigderson
TOCT
2009
Corpus ID: 6801859
Any proof of P ≠ NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen…
Expand
Highly Cited
2005
Highly Cited
2005
Non-deterministic exponential time has two-prover interactive protocols
L. Babai
,
L. Fortnow
,
C. Lund
computational complexity
2005
Corpus ID: 953323
We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson…
Expand
Highly Cited
2004
Highly Cited
2004
Combining answer set programming with description logics for the Semantic Web
Thomas Eiter
,
G. Ianni
,
Thomas Lukasiewicz
,
R. Schindlauer
,
H. Tompits
Artif. Intell.
2004
Corpus ID: 9123271
Highly Cited
2003
Highly Cited
2003
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Valentine Kabanets
,
R. Impagliazzo
STOC '03
2003
Corpus ID: 12451799
Abstract.We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower…
Expand
Highly Cited
1992
Highly Cited
1992
Algebraic methods for interactive proof systems
C. Lund
,
L. Fortnow
,
H. Karloff
,
N. Nisan
JACM
1992
Corpus ID: 207170996
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that…
Expand
Highly Cited
1991
Highly Cited
1991
Checking computations in polylogarithmic time
L. Babai
,
L. Fortnow
,
L. Levin
,
M. Szegedy
STOC '91
1991
Corpus ID: 16965640
Motivated by Manuel Blum’s concept of inst ante checking, we consider new, very fast and generic mechanisms of checking…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE