Phase transitions in the regular random 3-SAT problem-Reference-Cited by-同舟云学术

Phase transitions in the regular random 3-SAT problem

Published:1999 Issue: Volume: Page:292-300
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Béjar Ramón,Manyà Felip

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0095115

Reference9 articles.

1. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI’91, pages 331–337, 1991.

2. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394–397, 1962.

3. R. Hähnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. International Symposium on Multiple-Valued Logic, Victoria, pages 238–245. IEEE Press, 1991.

4. R. Hähnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905–927, 1994.

5. R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49–69, 1996.

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

1. On the Structure of the Boolean Satisfiability Problem: A Survey;ACM Computing Surveys;2022-03-30

2. Capturing Structure with Satisfiability;Principles and Practice of Constraint Programming — CP 2001;2001

3. A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas;Symbolic and Quantitative Approaches to Reasoning and Uncertainty;1999

4. Solving Combinatorial Problems with Regular Local Search Algorithms;Logic for Programming and Automated Reasoning;1999