Nondeterministic Strong Exponential Time Hypothesis (NSETH)

From Algorithm Wiki
Revision as of 10:30, 15 February 2023 by Admin (talk | contribs) (Created page with "== Target Problem == [[]] == Description == Refuting unsatisfiable $k$-CNF formulas on $n$ variables requires nondeterministic $2^{n-o(n)}$ time for unbounded $k$. == Implies the following Hypothesis == SETH == Implied by the following Hypothesis == == Computation Model == == Proven? == No (Variants have been disproved) == Year == == References/Citation == http://people.csail.mit.edu/virgi/eccentri.p...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Target Problem

[[]]

Description

Refuting unsatisfiable $k$-CNF formulas on $n$ variables requires nondeterministic $2^{n-o(n)}$ time for unbounded $k$.

Implies the following Hypothesis

SETH

Implied by the following Hypothesis

Computation Model

Proven?

No (Variants have been disproved)

Year

References/Citation

http://people.csail.mit.edu/virgi/eccentri.pdf Hypothesis 10

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Nondeterministic_Strong_Exponential_Time_Hypothesis_(NSETH)&oldid=44344"