Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,720,298 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
2-EXPTIME
ACC0
Adjacency matrix
Algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
LTL over EL Axioms
S. Borgwardt
,
Veronika Thost
2015
Corpus ID: 5788896
Aus der Einleitung: Description Logics (DLs) [BCM+07] are popular knowledge representation formalisms, mainly because they are…
Expand
2015
2015
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP
Kazuyuki Amano
,
Atsushi Saito
Language and Automata Theory and Applications
2015
Corpus ID: 6143311
Recently, Williams [STOC ’14] proved a separation between \(\mathsf {NEXP}\) and \(\mathsf {ACC}\circ \mathsf {THR}\), where an…
Expand
2013
2013
Languages with Efficient Zero-Knowledge PCP's are in SZK
Mohammad Mahmoody
,
David Xiao
IACR Cryptology ePrint Archive
2013
Corpus ID: 7513648
A Zero-Knowledge PCP (ZK-PCP) is a randomized PCP such that the view of any (perhaps cheating) efficient verifier can be…
Expand
Review
2012
Review
2012
Towards More Effective Tableaux Reasoning for CKR
Loris Bozzato
,
Martin Homola
,
L. Serafini
Description Logics
2012
Corpus ID: 18643144
Representation of context dependent knowledge in the Semantic Web is a recently emergent issue. A number of logical formalisms…
Expand
2012
2012
Bayesian-Game-Based Fuzzy Reinforcement Learning Control for Decentralized POMDPs
Rajneesh Sharma
,
M. Spaan
IEEE Transactions on Computational Intelligence…
2012
Corpus ID: 15918174
This paper proposes a Bayesian-game-based fuzzy reinforcement learning (RL) controller for decentralized partially observable…
Expand
2012
2012
Count Constraints and the Inverse OLAP Problem: Definition, Complexity and a Step toward Aggregate Data Exchange
D. Saccá
,
Edoardo Serra
,
A. Guzzo
International Symposium on Foundations of…
2012
Corpus ID: 46476741
A typical problem in database theory is to verify whether there exists a relation (or database) instance satisfying a number of…
Expand
2006
2006
A Semantic Matchmaking Method of Web Services Based on SHOIN^+ (D)*
Hai Wang
,
Zeng-zhi Li
IEEE Asia-Pacific Services Computing Conference
2006
Corpus ID: 16932855
Capability matchmaking is one of the key issue in the field of Web services research community because it is the basis of doing…
Expand
2006
2006
A Decidable Temporal Logic for Events and States
Savas Konur
Time
2006
Corpus ID: 1571738
This paper introduces a new interval temporal logic, TPL*. Existing interval temporal logics, we claim, are inadequate to…
Expand
2005
2005
Upper bounds for quantum interactive proofs with competing provers
Gus Gutoski
Cybersecurity and Cyberforensics Conference
2005
Corpus ID: 14785078
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and…
Expand
1996
1996
The Complexity of Deterministically Observable Finite-horizon Markov Decision Processes
J. Goldsmith
,
Christopher Lusena
,
M. Mundhenk
1996
Corpus ID: 18328437
We consider the complexity of the decision problem for diierent types of partially-observable Markov decision processes (MDPs…
Expand
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)
ACCEPT & CONTINUE