View source for WalkSAT (CNF-SAT Boolean Satisfiability)

← WalkSAT (CNF-SAT Boolean Satisfiability)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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

Return to WalkSAT (CNF-SAT Boolean Satisfiability).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/WalkSAT_(CNF-SAT_Boolean_Satisfiability)"

Navigation menu