DISTANCE-SAT: complexity and algorithms

被引：0
|
作者：
CRIL/Universite d'Artois, Lens, France [1 ]
机构：
来源：
Proc Natl Conf Artif Intell | / 642-647期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] Improved approximation algorithms for MAX NAE-SAT and MAX SAT
    Avidor, A
    Berkovitch, I
    Zwick, U
    APPROXIMATION AND ONLINE ALGORITHMS, 2006, 3879 : 27 - 40
  • [32] The parameterized complexity of k-flip local search for SAT and MAX SAT
    Szeider, Stefan
    DISCRETE OPTIMIZATION, 2011, 8 (01) : 139 - 145
  • [33] The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
    Szeider, Stefan
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 276 - 283
  • [34] Bounds on Greedy Algorithms for MAX SAT
    Poloczek, Matthias
    ALGORITHMS - ESA 2011, 2011, 6942 : 37 - 48
  • [35] SAT-based MaxSAT algorithms
    Ansotegui, Carlos
    Luisa Bonet, Maria
    Levy, Jordi
    ARTIFICIAL INTELLIGENCE, 2013, 196 : 77 - 105
  • [36] Improvements to hybrid incremental SAT algorithms
    Letombe, Florian
    Marques-Silva, Joao
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2008, PROCEEDINGS, 2008, 4996 : 168 - +
  • [37] Improved approximation algorithms for MAX SAT
    Asano, T
    Williamson, DP
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2002, 42 (01): : 173 - 202
  • [38] Randomized algorithms for 3-SAT
    Hofmeister, Thomas
    Schoening, Uwe
    Schuler, Rainer
    Watanabe, Osamu
    THEORY OF COMPUTING SYSTEMS, 2007, 40 (03) : 249 - 262
  • [39] Randomized Algorithms for 3-SAT
    Thomas Hofmeister
    Uwe Schoning
    Rainer Schuler
    Osamu Watanabe
    Theory of Computing Systems, 2007, 40 : 249 - 262
  • [40] Improved approximation algorithms for MAX SAT
    Asano, T
    Williamson, DP
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 96 - 105
12345