Abstract
We slightly improve the pruning technique presented in Dantsin et al. (Theoret. Comput. Sci. 289 (2002) 69) to obtain an O*(1.473n) deterministic algorithm for 3-SAT.
Original language | Undefined |
---|---|
Pages (from-to) | 303-313 |
Number of pages | 10 |
Journal | Theoretical computer science |
Volume | 329 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 2004 |
Keywords
- Local search
- 3-SAT
- IR-76360
- Exact algorithm
- METIS-219386