Dantsin, E., Goerdt, A., Hirsch, E.A., and Schoning, U. (2000). Deterministic algorithms for k-SAT based on covering codes and local search. Pro9 ceedings of the 27th International Colloqium on Automata, Languages and Programming. Springer. LNCS 1853, 236--247. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
On Converting CNF to DNF - Miltersen, Radhakrishnan, Wegener (2003) (Correct)
No context found.
Dantsin, E., Goerdt, A., Hirsch, E.A., and Schoning, U. (2000). Deterministic algorithms for k-SAT based on covering codes and local search. Pro9 ceedings of the 27th International Colloqium on Automata, Languages and Programming. Springer. LNCS 1853, 236--247.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC