The SAT problem

被引：0
|
作者：
Schöning U. [1 ]
机构：
[1] Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, James-Franck-Ring
来源：
Informatik-Spektrum | 2010年 / 33卷 / 05期
关键词：
D O I：
10.1007/s00287-010-0459-x
中图分类号：
学科分类号：
摘要：
[No abstract available]
引用
收藏
页码：479 / 483
页数：4
相关论文
共 50 条
  • [21] PROBABILISTICS ASPECTS OF THE SATISFACTION PROBLEM OF A BOOLEAN FORMULA - STUDY OF THE SAT, NUMBER-SAT AND MAX-SAT PROBLEMS
    ANDRE, P
    AI COMMUNICATIONS, 1995, 8 (01) : 54 - 55
  • [22] Convergence properties of optimization algorithms for the SAT problem
    Gu, J
    Gu, QP
    Du, DZ
    IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 209 - 219
  • [23] An improved SAT formulation for the social golfer problem
    Markus Triska
    Nysret Musliu
    Annals of Operations Research, 2012, 194 : 427 - 438
  • [24] Personification annealing algorithm for solving SAT problem
    Zhang, De-Fu
    Huang, Wen-Qi
    Wang, Hou-Xiang
    Jisuanji Xuebao/Chinese Journal of Computers, 2002, 25 (02): : 148 - 152
  • [25] A novel method for all solutions SAT problem
    Wang, Xiuqin
    Ma, Guangsheng
    Wang, Hao
    PROCEEDINGS OF NINTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING, 2008, : 41 - +
  • [26] Fill-a-Pix Puzzle as a SAT Problem
    Myat, Aye Myint
    Htwe, Khine Khine
    Funabiki, Nobuo
    2019 INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION TECHNOLOGIES (ICAIT), 2019, : 244 - 249
  • [27] A SAT approach for solving the staff transfer problem
    Acharyya, S.
    Bagchi, A.
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 64 - +
  • [28] An improved SAT formulation for the social golfer problem
    Triska, Markus
    Musliu, Nysret
    ANNALS OF OPERATIONS RESEARCH, 2012, 194 (01) : 427 - 438
  • [29] An algorithm for the SAT problem for formulae of linear length
    Wahlström, M
    ALGORITHMS - ESA 2005, 2005, 3669 : 107 - 118
  • [30] Satisfiability in Boolean Logic (SAT problem) is polynomial
    Rybakov, Vladimir V.
    JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS, 2021, 14 (05): : 667 - 671
12345