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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Aus der Einleitung: Description Logics (DLs) [BCM+07] are popular knowledge representation formalisms, mainly because they are… 
2015
2015
Recently, Williams [STOC ’14] proved a separation between \(\mathsf {NEXP}\) and \(\mathsf {ACC}\circ \mathsf {THR}\), where an… 
2013
2013
A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) efficient verifier can be… 
Review
2012
Review
2012
Representation of context dependent knowledge in the Semantic Web is a recently emergent issue. A number of logical formalisms… 
2012
2012
This paper proposes a Bayesian-game-based fuzzy reinforcement learning (RL) controller for decentralized partially observable… 
2012
2012
A typical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of… 
2006
2006
Capability matchmaking is one of the key issue in the field of Web services research community because it is the basis of doing… 
2006
2006
This paper introduces a new interval temporal logic, TPL*. Existing interval temporal logics, we claim, are inadequate to… 
2005
2005
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and… 
1996
1996
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs…