View source for More Believable Exponential Time Hypothesis (MBETH)

== 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 == 

[[Exponential Time Hypothesis (ETH)|ETH]]

== Implied by the following Hypothesis == 

[[Exponential Time Hypothesis (ETH)|ETH]], [[Strong Exponential Time Hypothesis (SETH)|SETH]]

== Computation Model == 

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

== Proven? == 

No

== Year == 



== References/Citation == 

https://people.csail.mit.edu/virgi/6.s078/lect2.pdf