Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Related topics

Related topics

30 relations
2-EXPTIMEACC0Adjacency matrixAlgorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
The Dynamic Quasiperpendicular Shock: Cluster Discoveries
The physics of collisionless shocks is a very broad topic which has been studied for more than five decades. However, there are a… 
Highly Cited
2012
Highly Cited
2012
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first… 
Highly Cited
2010
Highly Cited
2010
Improving exhaustive search implies superpolynomial lower bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable… 
Highly Cited
2009
Highly Cited
2009
The Complexity of Circumscription in DLs
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance… 
Highly Cited
2009
Highly Cited
2009
Algebrization: A New Barrier in Complexity Theory
Any proof of P ≠ NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen… 
Highly Cited
2005
Highly Cited
2005
Non-deterministic exponential time has two-prover interactive protocols
We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson… 
Highly Cited
2004
Highly Cited
2004
Combining answer set programming with description logics for the Semantic Web
Highly Cited
2003
Highly Cited
2003
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
Abstract.We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower… 
Highly Cited
1992
Highly Cited
1992
Algebraic methods for interactive proof systems
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that… 
Highly Cited
1991
Highly Cited
1991
Checking computations in polylogarithmic time
Motivated by Manuel Blum’s concept of inst ante checking, we consider new, very fast and generic mechanisms of checking… 
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