Sufficient Condition for Polynomial Solvability of Random 3-CNF Formulas
-
Published:2024-09-13
Issue:
Volume:
Page:
-
ISSN:1064-5624
-
Container-title:Doklady Mathematics
-
language:en
-
Short-container-title:Dokl. Math.
Publisher
Pleiades Publishing Ltd
Reference12 articles.
1. S. Cook, “The importance of the P versus NP question,” J. ACM 50, 27–29 (2003).
2. A. Biere, M. Heule, H. Van Maaren, and T. Walsh, Handbook of Satisfiability, 2nd ed. (IOS Press, Amsterdam, 2021). https://doi.org/10.3233/FAIA336
3. C. Gomes, H. Rautz, A. Sabharwal, and B. Selman, “Satisfiability solvers,” Handbook of Knowledge Representation (2008), pp. 89–133 .
4. P. Beame, H. A. Kautz, and A. Sabharwal, “Towards understanding and harnessing the potential of clause learning,” J. Artif. Intell. Res. 22, 319–351 (2004).
5. V. Ganesh and M. Vardi, “On the unreasonable effectiveness of SAT solvers,” Beyond the Worst-Case Analysis of Algorithms (2020), pp. 547–566.