Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

EXPTIME

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

Related topics

Related topics

42 relations
2-EXPTIMEAdjacency matrixAlgorithmAlternating Turing machine
Expand

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 autoencoders which are trained… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2009
Highly Cited
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… 
Highly Cited
2005
Highly Cited
2005
Formation of dense partonic matter in relativistic nucleus–nucleus collisions at RHIC: Experimental evaluation by the PHENIX Collaboration
Extensive experimental data from high-energy nucleus-nucleus collisions were recorded using the PHENIX detector at the… 
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2002
Highly Cited
2002
Computable measure of entanglement
We present a measure of entanglement that can be computed effectively for any mixed state of an arbitrary bipartite system. We… 
Highly Cited
1995
Highly Cited
1995
Bayesian Learning for Neural Networks
Artificial "neural networks" are widely used as flexible models for classification and regression applications, but questions… 
Highly Cited
1991
Highly Cited
1991
BPP has subexponential time simulations unless EXPTIME has publishable proofs
  • L. Babai, N. Nisan
  • [] Proceedings of the Sixth Annual Structure in…
  • 1991
  • Corpus ID: 42825822
It is shown that BPP can be simulated in subexponential time for infinitely many input lengths unless exponential time collapses… 
Highly Cited
1989
Highly Cited
1989
Astrophysics of Gaseous Nebulae and Active Galactic Nuclei
Preface Preface to First Edition General Introduction Photoionization Equilibrium Thermal Equilibrium Calculation of Emitted… 
Highly Cited
1987
Highly Cited
1987
AGGREGATION AND LINEARITY IN THE PROVISION OF INTERTEMPORAL INCENTIVES
The authors develop two themes in the theory of incentive schemes. First, one need not always use all of the information… 
Highly Cited
1977
Highly Cited
1977
An analysis of the variation of ocean floor bathymetry and heat flow with age
Two models, a simple cooling model and the plate model, have been advanced to account for the variation in depth and heat flow… 
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Highly Cited
1959
Highly Cited
1959
Molecular Transport in Liquids and Glasses
We have derived, by using simple considerations, a relation between the diffusion constant D in a liquid of hard spheres and the… 
  • figure 1
  • table 1
  • figure 2
  • table II
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE