More Believable Exponential Time Hypothesis (MBETH)
Revision as of 11:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == k-SAT == Description == There exists a $k \geq 3$ and a $\delta > 0$ so that $k$-SAT on $n$ variables cannot be solved in $O(2^{\delta n})$ == Implies the following Hypothesis == ETH == Implied by the following Hypothesis == ETH, SETH == Computation Model == Word-Ram on $\log(n)$ bit words == Proven? == No ==...")
Target Problem
Description
There exists a $k \geq 3$ and a $\delta > 0$ so that $k$-SAT on $n$ variables cannot be solved in $O(2^{\delta n})$
Implies the following Hypothesis
Implied by the following Hypothesis
Computation Model
Word-Ram on $\log(n)$ bit words
Proven?
No