WalkSAT (CNF-SAT Boolean Satisfiability)

From Algorithm Wiki
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n*mt*mf)$ == Space Complexity == $O(n)$ (same as above) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == == Year == 1994 == Reference == https://www.aaai.org/Papers/AAAI/1994/AAAI94-051.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n*mt*mf)$

Space Complexity

$O(n)$

(same as above)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

Yes,

Model of Computation

Year

1994

Reference

https://www.aaai.org/Papers/AAAI/1994/AAAI94-051.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=WalkSAT_(CNF-SAT_Boolean_Satisfiability)&oldid=45623"