Paturi, Pudlák, Saks, Zane (PPSZ) 2005 (k-SAT Boolean Satisfiability)

From Algorithm Wiki

Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == O^*({2}^{n-cn/k}) == Space Complexity == $O(kn)$ words (Derived in notes) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 2005 == Reference == https://dl.acm.org/doi/abs/10.1145/1066100.1066101")

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

Jump to navigation Jump to search

Time Complexity

O^*({2}^{n-cn/k})

Space Complexity

$O(kn)$ words

(Derived in notes)

Description

Approximate?

Exact

Randomized?

Yes, Monte Carlo

Model of Computation

Word RAM

Year

2005

Reference

https://dl.acm.org/doi/abs/10.1145/1066100.1066101

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Paturi,_Pudlák,_Saks,_Zane_(PPSZ)_2005_(k-SAT_Boolean_Satisfiability)&oldid=45626"