DISTANCE-SAT: complexity and algorithms

被引：0
|
作者：
CRIL/Universite d'Artois, Lens, France [1 ]
机构：
来源：
Proc Natl Conf Artif Intell | / 642-647期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] On average case complexity of SAT for symmetric distribution
    J Logic Comput, 1 (71):
  • [42] Modeling SAT-attack Search Complexity
    Phatharodom, Saran
    Kandasamy, Nagarajan
    Savidis, Ioannis
    2020 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2020,
  • [43] Complexity Analysis of the SAT Attack on Logic Locking
    Zhong, Yadi
    Guin, Ujjwal
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2023, 42 (10) : 3143 - 3156
  • [44] Understanding the complexity of #SAT using knowledge compilation
    Capelli, Florent
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [45] A (Biased) Proof Complexity Survey for SAT Practitioners
    Nordstrom, Jakob
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2014, 2014, 8561 : 1 - 6
  • [46] Hardness of Approximation Algorithms on k-SAT and (k,s)-SAT Problems
    Deng, Tianyan
    Xu, Daoyun
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 60 - 64
  • [47] ON COMPLEXITY OF ALGORITHMS
    MULLIN, AA
    JOURNAL OF SYMBOLIC LOGIC, 1966, 31 (01) : 148 - &
  • [48] Width-based algorithms for SAT and CIRCUIT-SAT - Extended abstract
    Broering, E
    Lokam, SV
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 162 - 171
  • [49] UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
    Tompkins, DAD
    Hoos, HH
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 306 - 320
  • [50] COMPLEXITY OF ALGORITHMS
    WERNER, G
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1970, 4 (NR2): : 33 - 50
12345