GSAT (CNF-SAT Boolean Satisfiability)
Jump to navigation
Jump to search
Time Complexity
$O(n*mt*mf)$
Space Complexity
$O(n)$
(derived in notes)
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
Yes,
Model of Computation
Year
1992
Reference
http://www.cs.cornell.edu/selman/papers/pdf/92.aaai.gsat.pdf