Random 2-SAT and unsatisfiability

被引：0
|
作者：
Verhoeven, Yann [1 ]
机构：
[1] LRI, Bat 490, Université Paris Sud, 91405, Orsay, France
来源：
Information Processing Letters | 1999年 / 72卷 / 03期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
9
引用
收藏
页码：119 / 123
相关论文
共 50 条
  • [31] A Linear Time Algorithm for Quantum 2-SAT
    de Beaudrap, Niel
    Gharibian, Sevag
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
  • [32] Balanced Max 2-Sat Might Not be the Hardest
    Austrin, Per
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 189 - 197
  • [33] Almost 2-SAT is fixed-parameter tractable
    Razgon, Igor
    O'Sullivan, Barry
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2009, 75 (08) : 435 - 450
  • [34] The 2-SAT problem of regular signed CNF formulas
    Beckert, B
    Hähnle, R
    Manyà, F
    30TH IEEE INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2000, : 331 - 336
  • [35] A BOUNDED APPROXIMATION FOR THE MINIMUM COST 2-SAT PROBLEM
    GUSFIELD, D
    PITT, L
    ALGORITHMICA, 1992, 8 (02) : 103 - 117
  • [36] Algorithms for counting 2-SAT solutions and colorings with applications
    Furer, Martin
    Kasiviswanathan, Shiva Prasad
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 47 - +
  • [37] Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random k-SAT
    Antonopoulou, Hera
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2020, 23 (07): : 1431 - 1438
  • [38] 基于寻找可满足2-SAT子问题的SAT算法
    傅阳春
    周育人
    计算机应用研究, 2010, 27 (02) : 462 - 464
  • [39] Tight approximability of MAX 2-SAT and relatives, under UGC
    Brakensiek, Joshua
    Huang, Neng
    Zwick, Uri
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 1328 - 1344
  • [40] Algorithms for variable-weighted 2-SAT and dual problems
    Porschen, Stefan
    Speckenmeyer, Ewald
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2007, PROCEEDINGS, 2007, 4501 : 173 - +
12345