FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2018
0102019832018

Related topics

Related topics

26 relations
2-EXPTIMEACC0Adjacency matrixAlgorithm
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
NEXPTIME
Algorithm
Computational complexity theory
Decision problem
Formal language
EXPTIME

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Tableau Method and NEXPTIME-Completeness of DEL-Sequents
Dynamic Epistemic Logic (DEL) deals with the representation of situations in a multi-agent and dynamic setting. It can express in… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
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 <b>NEXP</b… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
NEXPTIME-Complete Description Logics with Concrete Domains
Concrete domains are an extension of Description Logics (DLs) that allow one to integrate reasoning about conceptual knowledge… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 9
Is this relevant?
1999
1999
Satisfiability of Word Equations with Constants is in NEXPTIME
We prove that the length of a shortest solution of a word equation of length n can bounded by a double exponential function in n… (More)
Is this relevant?
1998
1998
Tarskian Set Constraints Are in NEXPTIME
In this paper we show that satissability of Tarskian set constraints (without recursion) can be decided in exponential time. This… (More)
Is this relevant?
1994
1994
Set constraints with projections are in NEXPTIME
Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysis… (More)
Is this relevant?
1994
1994
Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete
A system of set constraints is a system of expressions E C F where E and F describe sets of ground terms over a ranked alphabet… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
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… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Sparse Sets in NP-P: EXPTIME versus NEXPTIME
This paper investigates the structural properties of sets in <italic>NP-P</italic> and shows that the computational difficulty of… (More)
Is this relevant?