Hertli (Modified PPSZ) (4SAT Boolean Satisfiability)

From Algorithm Wiki

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/doi/abs/10.1137/120868177

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