Exact complexity and satisfiability (invited talk)

被引：0
|
作者：
Department of Computer Science and Engineering, University of California, San Diego, San Diego, CA 92093-0404, United States [1 ]
机构：
来源：
Lect. Notes Comput. Sci. | / 1-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Computational complexity
引用
收藏
相关论文
共 50 条
  • [41] Improved algorithms for the general exact satisfiability problem
    Hoi, Gordon
    Stephan, Frank
    THEORETICAL COMPUTER SCIENCE, 2021, 889 : 60 - 84
  • [42] Exact Template Matching Using Boolean Satisfiability
    Abdessaied, Nabila
    Soeken, Mathias
    Wille, Robert
    Drechsler, Rolf
    2013 IEEE 43RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC (ISMVL 2013), 2013, : 328 - 333
  • [43] Exact Cover via Satisfiability: An Empirical Study
    Junttila, Tommi
    Kaski, Petteri
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING-CP 2010, 2010, 6308 : 297 - +
  • [44] Algorithms for four variants of the exact satisfiability problem
    Dahllöf, V
    Jonsson, P
    Beigel, R
    THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 373 - 394
  • [45] On variable-weighted exact satisfiability problems
    Stefan Porschen
    Annals of Mathematics and Artificial Intelligence, 2007, 51 : 27 - 54
  • [46] Complexity of satisfiability problems with symmetric polynomial clauses
    Creignou, N
    More, M
    JOURNAL OF LOGIC AND COMPUTATION, 1997, 7 (03) : 353 - 366
  • [47] A NOTE ON THE COMPLEXITY OF THE SATISFIABILITY OF MODAL HORN CLAUSES
    DELCERRO, LF
    PENTTONEN, M
    JOURNAL OF LOGIC PROGRAMMING, 1987, 4 (01): : 1 - 10
  • [48] ON THE COMPLEXITY OF RANDOM SATISFIABILITY PROBLEMS WITH PLANTED SOLUTIONS
    Feldman, Vitaly
    Perkins, Will
    Vempala, Santosh
    SIAM JOURNAL ON COMPUTING, 2018, 47 (04) : 1294 - 1338
  • [49] ON THE COMPLEXITY OF THE MAXIMUM SATISFIABILITY PROBLEM FOR HORN FORMULAS
    JAUMARD, B
    SIMEONE, B
    INFORMATION PROCESSING LETTERS, 1987, 26 (01) : 1 - 4
  • [50] The Complexity of Satisfiability for Fragments of CTL and CTL star
    Meier, Arne
    Mundhenk, Martin
    Thomas, Michael
    Vollmer, Heribert
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 223 (0C) : 201 - 213
12345