Recognizing more random unsatisfiable 3-SAT instances efficiently

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that random 3-SAT formulas with poly(log n).n3/2= n3/2 + o(1)clauses can be efficiently certified as unsatisfiable. This improves a previous bound of n3/2 + epsilonclauses. There epsilon > 0 is a constant. © 2003.

Cite

CITATION STYLE

APA

Goerdt, A., & Lanka, A. (2003). Recognizing more random unsatisfiable 3-SAT instances efficiently. Electronic Notes in Discrete Mathematics, 16, 21–46. https://doi.org/10.1016/S1571-0653(04)00461-5

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