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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

This work raises some new questions about the validity of blindly assuming that Elber’s effective stress intensity factor is the…

2013

Forecasting already plays a crucial role in the current electricity grid as a key part of planning and energy management…

2011

Let $\mu$ be a Borel probability measure with compact support. We consider exponential type orthonormal bases, Riesz bases and…

2010

For many practical applications of ASP, for instance data integration or planning, query answering is important, and therefore…

2010

Exponential stabilizability for a class of the singular distributed parameter control systems was discussed in Hilbert space via…

2008

Convergence of a class of discrete-time cellular neural networks with timevarying delays is considered. By utilizing a difference…

2008

. The paper summarizes our experiences with optimization techniques for well-known tableau-based description logic reasoning…

1999

This work is settled in the area of complexity theory for rest icted variants of branching programs. Today, branching programs…

1997

Randomized branching programs are a probabilistic model of computation defined in analogy to the well-known probabilistic Turing…

1994

Concerns a class of adaptive control schemes, motivated from nonlinear systems theory, for minimum-phase linear time-invariant…