Chen, Hubie (2003) An algorithm for SAT above the threshold. In: Giunchiglia, E. and Tacchella, A. (eds.) 6th International Conference: Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 2919. Springer, pp. 14-24. ISBN 9783540208518.
Abstract
We study algorithms for finding satisfying assignments of randomly generated 3-SAT formula. In particular, we consider distributions of highly constrained formulas (that is, “above the threshold” formulas) restricted to satisfiable instances. We obtain positive algorithmic results, showing that such formulas can be solved in low exponential time.
Metadata
| Item Type: | Book Section |
|---|---|
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Sarah Hall |
| Date Deposited: | 09 Mar 2021 17:30 |
| Last Modified: | 09 Aug 2023 12:50 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/43361 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
