Backdoors in Satisfiability Problems
Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment t...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4810 |