GSAT (CNF-SAT Boolean Satisfiability)
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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