Skip to main content
Journal Article

An algorithm for SAT above the threshold

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 2919 14-24
DOI: 10.1007/978-3-540-24605-3_2
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Chen, H. (2004). An algorithm for SAT above the threshold. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2919, 14–24. https://doi.org/10.1007/978-3-540-24605-3_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free