The SAT problem

被引:0
|
作者
Schöning U. [1 ]
机构
[1] Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, James-Franck-Ring
关键词
D O I
10.1007/s00287-010-0459-x
中图分类号
学科分类号
摘要
[No abstract available]
引用
收藏
页码:479 / 483
页数:4
相关论文
共 50 条
  • [31] Expressively Modeling the Social Golfer Problem in SAT
    Lardeux, Frederic
    Monfroy, Eric
    INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2015 COMPUTATIONAL SCIENCE AT THE GATES OF NATURE, 2015, 51 : 336 - 345
  • [32] A SAT Approach for Solving The Nurse Scheduling Problem
    Kundu, Sudip
    Acharyya, Sriyankar
    2008 IEEE REGION 10 CONFERENCE: TENCON 2008, VOLS 1-4, 2008, : 2258 - 2263
  • [33] Solution of a SAT problem on a photochemical DNA computer
    Ogasawara, S
    Fujimoto, K
    CHEMISTRY LETTERS, 2005, 34 (03) : 378 - 379
  • [34] On solving the Partial MAX-SAT problem
    Fu, Zhaohui
    Malik, Sharad
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 252 - 265
  • [35] The K-SAT problem in a simple limit
    Leuzzi, L
    Parisi, G
    JOURNAL OF STATISTICAL PHYSICS, 2001, 103 (5-6) : 679 - 695
  • [36] Solving SAT problem with a Multiagent Evolutionary Algorithm
    Li, Jinshu
    Wang, Heyong
    Liu, Jing
    Jiao, Licheng
    2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 1416 - 1422
  • [37] Quantum hybrid algorithm for solving SAT problem
    Varmantchaonala, Charles Moudina
    Fendji, Jean Louis Kedieng Ebongue
    Njafa, Jean Pierre Tchapet
    Atemkeng, Marcellin
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 121
  • [38] The K-SAT Problem in a Simple Limit
    Luca Leuzzi
    Giorgio Parisi
    Journal of Statistical Physics, 2001, 103 : 679 - 695
  • [39] Weak lumpability in the k-SAT problem
    Grinfeld, M
    Knight, PA
    APPLIED MATHEMATICS LETTERS, 2000, 13 (06) : 49 - 53
  • [40] Exploring the Limits of Problem-Specific Adaptations of SAT Solvers in SAT-Based Cryptanalysis
    Kochemazov, Stepan
    PARALLEL COMPUTATIONAL TECHNOLOGIES, 2021, 1437 : 149 - 163