Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. (English)
Giunchiglia, Enrico (ed.) et al., Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5‒8, 2003. Selected revised papers. Berlin: Springer (ISBN 3-540-20851-8/pbk). Lect. Notes Comput. Sci. 2919, 150-161 (2004).
1
Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs. (English)
Electron. Colloq. Comput. Complex. 10, No. 010 (2003).
2
Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs (English)
SAT, 150-161 (2003).
3
Minimally unsatisfiable $CNF$ formulas. (English)
Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 74, 190-192 (2001).
4
Minimally unsatisfiable CNF formulas (English)
Bulletin of the EATCS 74, 190-192 (2001).
5
Start
Contact
Print
General Help
