Skip to search formSkip to main contentSkip to account menu

Exponential time hypothesis

Known as: ETH (complexity), Eth (disambiguation), Strong exponential time hypothesis 
In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by . The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We present results of self-consistent, high-resolution cosmological simulations of galaxy formation at z ∼ 3. The simulations… 
2009
2009
The global-in-time existence of weak nonnegative solutions to a sixth-order nonlinear parabolic equation in one space dimension… 
2008
2008
The analytical techniques of the Nekhoroshev theorem are used to provide estimates on the coefficient of Arnold diffusion along a… 
2004
2004
We consider a wireless basestation transmitting high-speed data to multiple mobile users in a cell. The channel conditions… 
2001
2001
The volume of beer froth decays exponentially with time. This property is used to demonstrate the exponential decay law in the… 
1997
1997
Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing… 
Highly Cited
1990
Highly Cited
1990
We solve exactly the one-dimensional diffusion-limited single-species coagulation process (A+A→A) with back reactions (A→A+A) and… 
Highly Cited
1989
Highly Cited
1989
The problem of tracking time-varying linear systems is discussed. The focus is on the model quality in terms of the mean square…