EXPTIME

Known as: DEXPTIME, Exponential running time, EXPTIME-complete 
In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that have… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
020040060019382016

Related topics

Related topics

42 relations
2-EXPTIMEAdjacency matrixAlgorithmAlternating Turing machine
(More)

Related mentions per year

Related mentions per year

1936-2019
19401960198020002020
EXPTIME
Algorithm
Time complexity
Computational complexity theory
Decision problem
P (complexity)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Stacked Denoising Autoencoders: Learning Useful Representations in a Deep Network with a Local Denoising Criterion
We explore an original strategy for building deep networks, based on stacking layers of denoising autoencoderswhich are trained… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
EXPTIME Tableaux for the Coalgebraic µ-Calculus
The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally… (More)
Is this relevant?
2008
2008
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within ε in time… (More)
Is this relevant?
2006
2006
ATL Satisfiability is Indeed EXPTIME-complete
The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the… (More)
  • figure 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A Unifying View of Sparse Approximate Gaussian Process Regression
We provide a new unifying view, including all existing prope r probabilistic sparse approximations for Gaussian process… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Uncertainty principles and ideal atomic decomposition
Suppose a discrete-time signal ( ), 0 , is a superposition of atoms taken from a combined time–frequency dictionary made of spike… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
American Finance Association On Persistence in Mutual Fund Performance
  • Mark M. Carhart
  • 1997
Using a sample free of survivor bias, I demonstrate that common factors in stock returns and investment expenses almost… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Exptime Tableaux for ALC
We propose a tableaux calculus requiring simple expo nential time for satis ability of an ALC concept C wrt a TBox T containing… (More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Word Problems Requiring Exponential Time: Preliminary Report
The equivalence problem for Kleene's regular expressions has several effective solutions, all of which are computationally… (More)
Is this relevant?
Highly Cited
1967
Highly Cited
1967
Nearest neighbor pattern classification
The case of n unity-variance random variables x1, XZ,. * *, x, governed by the joint probability density w(xl, xz, * * * x,) is… (More)
  • figure 1
  • figure 2
Is this relevant?