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 条
  • [21] Exact satisfiability threshold for k-satisfiability problems on a Bethe lattice
    Krishnamurthy, Supriya
    Sumedha
    PHYSICAL REVIEW E, 2015, 92 (04):
  • [22] Algorithms for Max Hamming exact satisfiability
    Dahllöf, V
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 829 - 838
  • [23] Exact Diagnosis using Boolean Satisfiability
    Riener, Heinz
    Fey, Goerschwin
    2016 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2016,
  • [24] Exact satisfiability of linear CNF formulas
    Schuh, Bernd R.
    DISCRETE APPLIED MATHEMATICS, 2018, 251 : 1 - 4
  • [25] AUTOSAR Classic Platform Flexibility Managing the complexity of distributed embedded software development Invited Talk
    Zeeb, Alexander
    2021 IEEE 18TH INTERNATIONAL CONFERENCE ON SOFTWARE ARCHITECTURE COMPANION (ICSA-C), 2021, : 167 - 167
  • [26] Complexity of generalized satisfiability counting problems
    Creignou, N
    Hermann, M
    INFORMATION AND COMPUTATION, 1996, 125 (01) : 1 - 12
  • [27] Parametrised Complexity of Satisfiability in Temporal Logic
    Lueck, Martin
    Meier, Arne
    Schindler, Irena
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2017, 18 (01)
  • [28] Complexity of Generalized Satisfiability Counting Problems
    Dept. de Mathématiques, Université de Caen, 14032 Caen, France
    不详
    Inf Comput, 1 (1-12):
  • [29] THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL
    Meier, Arne
    Thomas, Michael
    Vollmer, Heribert
    Mundhenk, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (05) : 901 - 918
  • [30] THE COMPLEXITY OF THE SATISFIABILITY PROBLEM FOR KROM FORMULAS
    DENENBERG, L
    LEWIS, HR
    THEORETICAL COMPUTER SCIENCE, 1984, 30 (03) : 319 - 341
12345