Why solutions can be hard to find : a featural theory of cost for a local search algorithm on random satisfiability instances
The local search algorithm WSAT is one of the most successful algorithms for solving the archetypal NP-complete problem of satisfiability (SAT). It is notably effective at solving RANDOM-3-SAT instances near the so-called "satisfiability threshold", which are thought to be universally hard...
| Main Author: | |
|---|---|
| Published: |
University of Edinburgh
2001
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.661976 |