Probabilistic approach to the satisfiability problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Probabilistic approach to the satisfiability problem

Published:1991-04 Issue:1 Volume:81 Page:65-75
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Dubois Olivier,Carlier Jacques

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference5 articles.

1. The complexity of theorem-proving procedures;Cook,1971

2. Counting the number of solutions for instances of satisfiability;Dubois;Theoret. Comput. Sci.,1991

3. Computers and Intractability, A Guide to the theory of NP-completeness;Garey,1979

4. Etude statistique de l'existence de solutions de problèmes SAT;Simon;C.R.A.S. Paris,1986

5. Number of solutions of SAT-instances;Simon;E.S.P.R. Workshop,1987

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

1. A Natural Explanation for the Minimum Entropy Production Principle;How Uncertainty-Related Ideas Can Provide Theoretical Explanation For Empirical Dependencies;2021

2. Analytical Techniques for Analyzing How Systems Change with Time: A Natural Explanation for the Minimum Entropy Production Principles;Studies in Systems, Decision and Control;2020

3. Algorithms for the Satisfiability (SAT) Problem;Handbook of Combinatorial Optimization;1999

4. Improving backtrack search for SAT by means of redundancy;Lecture Notes in Computer Science;1999

5. Boosting complete techniques thanks to local search methods;Annals of Mathematics and Artificial Intelligence;1998

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP