Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search-Reference-Cited by-同舟云学术

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search

Published:2000 Issue: Volume: Page:236-247
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Dantsin Evgeny,Goerdt Andreas,Hirsch Edward A.,Schöning Uwe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45022-X_21

Reference16 articles.

1. R. B. Ash. Information Theory. Dover, 1965.

2. L. Bolc and J. Cytowski. Search Methods for Artificial Intelligence. Academic Press, 1992.

3. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein. Covering Codes, volume 54 of Mathematical Library. Elsevier, 1997.

4. E. Dantsin. Two propositional proof systems based on the splitting method (in Russian). Zapiski Nauchnykh Seminarov LOMI, 105:24–44, 1981. English translation: Journal of Soviet Mathematics, 22(3):1293–1305, 1983.

5. E. A. Hirsch. Two new upper bounds for SAT. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’98, pages 521–530, 1998. A journal version is to appear in Journal of Automated Reasoning, 2000.

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Kolmogorov Complexity with Error;STACS 2006;2006

2. On the Quality and Quantity of Random Decisions in Stochastic Local Search for SAT;Advances in Artificial Intelligence;2006

3. On converting CNF to DNF;Theoretical Computer Science;2005-11

4. Algorithmics in Exponential Time;STACS 2005;2005

5. Derandomization of Schuler’s Algorithm for SAT;Theory and Applications of Satisfiability Testing;2005