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 条
  • [21] Certifying unsatisfiability of random 2k-SAT formulas using approximation techniques
    Coja-Oghlan, A
    Goerdt, A
    Lanka, A
    Schädlich, F
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 15 - 26
  • [22] Research on the Solution Space of 2-SAT and Max-2-SAT
    Li, Bai-Feng
    Wei-Wei
    Liu, Chao-Qun
    3RD ANNUAL INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND APPLICATIONS (ITA 2016), 2016, 7
  • [23] Approximating MIN 2-SAT and MIN 3-SAT
    Avidor, A
    Zwick, U
    THEORY OF COMPUTING SYSTEMS, 2005, 38 (03) : 329 - 345
  • [24] Efficient algorithm for a quantum analogue of 2-SAT
    Bravyi, Sergey
    CROSS DISCIPLINARY ADVANCES IN QUANTUM COMPUTING, 2011, 536 : 33 - 48
  • [25] Almost every 2-SAT function is unate
    Allen, Peter
    ISRAEL JOURNAL OF MATHEMATICS, 2007, 161 (01) : 311 - 346
  • [26] Almost every 2-SAT function is unate
    Peter Allen
    Israel Journal of Mathematics, 2007, 161 : 311 - 346
  • [27] A Clustering Algorithm based on 2-SAT Problem
    Xiao JingZhong
    Xiao Li
    2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 1, 2011, : 401 - 403
  • [28] Max 2-SAT with up to 108 qubits
    Santra, Siddhartha
    Quiroz, Gregory
    Steeg, Greg Ver
    Lidar, Daniel A.
    NEW JOURNAL OF PHYSICS, 2014, 16
  • [29] BRANCHING PROCESS APPROACH FOR 2-SAT THRESHOLDS
    Mossel, Elchanan
    Sen, Arnab
    JOURNAL OF APPLIED PROBABILITY, 2010, 47 (03) : 796 - 810
  • [30] Exact MAX 2-SAT: Easier and faster
    Furer, Martin
    Kasiviswanathan, Shiva Prasad
    SOFSEM 2007: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2007, 4362 : 272 - +
12345