Nondeterministic Strong Exponential Time Hypothesis (NSETH): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3011:30, 15 February 2023‎ Admin talk contribs‎ 491 bytes +491‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Nondeterministic_Strong_Exponential_Time_Hypothesis_(NSETH)"