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)

Related topics

Related topics

30 relations
2-EXPTIMEACC0Adjacency matrixAlgorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
LTL over EL Axioms
Aus der Einleitung: Description Logics (DLs) [BCM+07] are popular knowledge representation formalisms, mainly because they are… 
2015
2015
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP
Recently, Williams [STOC ’14] proved a separation between \(\mathsf {NEXP}\) and \(\mathsf {ACC}\circ \mathsf {THR}\), where an… 
2013
2013
Languages with Efficient Zero-Knowledge PCP's are in SZK
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
Towards More Effective Tableaux Reasoning for CKR
Representation of context dependent knowledge in the Semantic Web is a recently emergent issue. A number of logical formalisms… 
2012
2012
Bayesian-Game-Based Fuzzy Reinforcement Learning Control for Decentralized POMDPs
This paper proposes a Bayesian-game-based fuzzy reinforcement learning (RL) controller for decentralized partially observable… 
2012
2012
Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange
A typical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of… 
2006
2006
A Semantic Matchmaking Method of Web Services Based on SHOIN^+ (D)*
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
A Decidable Temporal Logic for Events and States
This paper introduces a new interval temporal logic, TPL*. Existing interval temporal logics, we claim, are inadequate to… 
2005
2005
Upper bounds for quantum interactive proofs with competing provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and… 
1996
1996
The Complexity of Deterministically Observable Finite-horizon Markov Decision Processes
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)