Exponential Time Hypothesis (ETH)

From Algorithm Wiki
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == 3SAT == Description == There is some constant $\delta > 0$ such that CNF-SAT requires $\Omega(2^{\delta n})$. == Implies the following Hypothesis == MBETH == Implied by the following Hypothesis == SETH, MBETH == Computation Model == Word-RAM on $\log(n)$ bit words == Proven? =...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Target Problem

3SAT

Description

There is some constant $\delta > 0$ such that CNF-SAT requires $\Omega(2^{\delta n})$.

Implies the following Hypothesis

MBETH

Implied by the following Hypothesis

SETH, MBETH

Computation Model

Word-RAM on $\log(n)$ bit words

Proven?

No

Year

References/Citation

http://people.csail.mit.edu.ezproxy.canberra.edu.au/virgi/eccentri.pdf Page 5