Hertli (Modified PPSZ) (4SAT Boolean Satisfiability)

From Algorithm Wiki

Revision as of 11:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.46899}^n)$ == Space Complexity == $O(kn)$ words (Not sure, please look) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 2014 == Reference == https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/120868177")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O({1.46899}^n)$

Space Complexity

$O(kn)$ words

(Not sure, please look)

Description

Approximate?

Exact

Randomized?

Yes, Monte Carlo

Model of Computation

Word RAM

Year

2014

Reference

https://epubs-siam-org.ezproxy.canberra.edu.au/doi/abs/10.1137/120868177

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Hertli_(Modified_PPSZ)_(4SAT_Boolean_Satisfiability)&oldid=45628"