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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
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
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2009
Highly Cited
2009
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
2004
Highly Cited
2004
Towards the integration of rules and ontologies in the Semantic Web, we propose a combination of logic programming under the… Expand
  • table II
Highly Cited
2004
Highly Cited
2004
Abstract.We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower… Expand
Highly Cited
2000
Highly Cited
2000
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
Highly Cited
1992
Highly Cited
1992
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
Motivated by Manuel Blum’s concept of inst ante checking, we consider new, very fast and generic mechanisms of checking… Expand
Highly Cited
1991
Highly Cited
1991
We determine the exact power of two-prover interactive proof systems introduced by Ben-Or, Goldwasser, Kilian, and Wigderson… Expand
Highly Cited
1990
Highly Cited
1990
The exact power of two-prover interactive proof systems (MIP) introduced by M. Ben-Or et al. (Proc. 20th Symp. on Theory of… Expand