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 条

[1] On SAT01 problem
Busygin, S
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP'99, 1999, 1713 : 476 - 477
[2] Compiling problem specifications into SAT
Cadoli, M
Schaerf, A
ARTIFICIAL INTELLIGENCE, 2005, 162 (1-2) : 89 - 120
[3] A NEW APPROACH TO THE SAT PROBLEM
COT, N
BELLAICHE, C
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1991, 313 (11): : 801 - 804
[4] A PROBABILISTIC GENERALIZATION OF THE SAT PROBLEM
GELENBE, E
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1992, 315 (03): : 339 - 342
[5] Compiling problem specifications into SAT
Cadoli, M
Schaerf, A
PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2001, 2028 : 387 - 401
[6] An Optical Solution for the SAT Problem
Oltean, Mihai
Muntean, Oana
OPTICAL SUPERCOMPUTING, 2011, 6748 : 53 - 62
[7] On Optimizing the Satisfiability (SAT) Problem
顾钧
堵丁柱
Journal of Computer Science and Technology, 1999, (01) : 1 - 17
[8] On optimizing the satisfiability (SAT) problem
Jun Gu
Qianping Gu
Dingzhu Du
Journal of Computer Science and Technology, 1999, 14 (1) : 1 - 17
[9] Logical Cryptanalysis as a SAT Problem
Fabio Massacci
Laura Marraro
Journal of Automated Reasoning, 2000, 24 : 165 - 203
[10] Logical cryptanalysis as a SAT problem
Massacci, F
Marraro, L
JOURNAL OF AUTOMATED REASONING, 2000, 24 (1-2) : 165 - 203