DISTANCE-SAT: complexity and algorithms

被引：0
|
作者：
CRIL/Universite d'Artois, Lens, France [1 ]
机构：
来源：
Proc Natl Conf Artif Intell | / 642-647期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] DISTANCE-SAT: Complexity and algorithms
    Bailleux, O
    Marquis, P
    SIXTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-99)/ELEVENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE (IAAI-99), 1999, : 642 - 647
  • [2] Some Computational Aspects of distance-sat
    Olivier Bailleux
    Pierre Marquis
    Journal of Automated Reasoning, 2006, 37 : 231 - 260
  • [3] Some computational aspects of DISTANCE-SAT
    Bailleux, Olivier
    Marquis, Pierre
    JOURNAL OF AUTOMATED REASONING, 2006, 37 (04) : 231 - 260
  • [4] A note on SAT algorithms and proof complexity
    Krajicek, Jan
    INFORMATION PROCESSING LETTERS, 2012, 112 (12) : 490 - 493
  • [5] Algorithms for Sat and Upper Bounds on Their Complexity
    M. A. Vsemirnov
    E. A. Hirsch
    E. Ya. Dantsin
    S. V. Ivanov
    Journal of Mathematical Sciences, 2003, 118 (2) : 4948 - 4962
  • [6] Algorithms and complexity results for #SAT and Bayesian inference
    Bacchus, F
    Dalmao, S
    Pitassi, T
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 340 - 351
  • [7] Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
    Hagiya, M
    Rose, JA
    Komiya, K
    Sakamoto, K
    THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) : 59 - 71
  • [8] Connecting SAT Algorithms and Complexity Lower Bounds
    Williams, Ryan
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2011, 2011, 6695 : 1 - 2
  • [9] Translocation distance: Algorithms and complexity
    Wang, Lusheng
    ADVANCES IN COMPUTERS , VOL 68: COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 68 : 105 - 126
  • [10] Distance approximating trees: Complexity and algorithms
    Dragan, Feodor F.
    Yan, Chenyu
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 260 - 271
12345