View source for GSAT (CNF-SAT Boolean Satisfiability)

← GSAT (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)$ 

(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

Return to GSAT (CNF-SAT Boolean Satisfiability).

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/GSAT_(CNF-SAT_Boolean_Satisfiability)"

Navigation menu