Abstract
Schoening in 1999 presented a simple randomized algorithm for k-SAT with running time akn·poly(n) for ak = 2(k-1)/k. We give a deterministic version of this algorithm running in time akn+o(n). © 2011 ACM.
Author supplied keywords
Cite
CITATION STYLE
APA
Moser, R. A., & Scheder, D. (2011). A full derandomization of Schöning’s k-SAT algorithm. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 245–251). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993670
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free