Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

30 relations
2-EXPTIMEACC0Adjacency matrixAlgorithm
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Interactive Oracle Proofs
We initiate the study of a proof system model that naturally combines interactive proofs IPs and probabilistically-checkable… Expand
  • figure 2
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Non-uniform ACC Circuit Lower Bounds
  • Ryan Williams
  • IEEE 26th Annual Conference on Computational…
  • 2011
    • Corpus ID: 7020039
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MOD$m$ gates, where $m > 1… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
In this paper we show that lower bounds for bounded depth arithmetic circuits imply derandomization of polynomial identity… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Decentralized Control of Cooperative Systems: Categorization and Complexity Analysis
Decentralized control of cooperative systems captures the operation of a group of decision-makers that share a single global… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Solving Transition Independent Decentralized Markov Decision Processes
Formal treatment of collaborative multi-agent systems has been lagging behind the rapid progress in sequential decision making by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Derandomizing polynomial identity tests means proving circuit lower bounds
We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to proving circuit lower bounds for NEXP. More… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
In this paper we consider quantum interactive proof systems, which are interactive proof systems in which the prover and verifier… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
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