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：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：119 / 123

共 50 条

[1] Random 2-SAT and unsatisfiability
Verhoeven, Y
INFORMATION PROCESSING LETTERS, 1999, 72 (3-4) : 119 - 123
[2] A remark on random 2-SAT
Goerdt, A
DISCRETE APPLIED MATHEMATICS, 1999, 97 : 107 - 110
[3] Random 2-SAT: results and problems
de la Vega, WF
THEORETICAL COMPUTER SCIENCE, 2001, 265 (1-2) : 131 - 146
[4] Random 2-SAT with Prescribed Literal Degrees
Colin Cooper
Alan Frieze
Gregory B. Sorkin
Algorithmica, 2007, 48 : 249 - 265
[5] Random 2-SAT with prescribed literal degrees
Cooper, Colin
Frieze, Alan
Sorkin, Gregory B.
ALGORITHMICA, 2007, 48 (03) : 249 - 265
[6] Approximating Highly Satisfiable Random 2-SAT
Bulatov, Andrei A.
Wang, Cong
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2014, 2014, 8561 : 384 - 398
[7] Random 2-sat does not depend on a giant
Kravitz, David
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (02) : 408 - 422
[8] Random 2-SAT Solution Components and a Fitness Landscape
Pitman, Damien
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (02): : 45 - 62
[9] The number of satisfying assignments of random 2-SAT formulas
Achlioptas, Dimitris
Coja-Oghlan, Amin
Hahn-Klimroth, Max
Lee, Joon
Mueller, Noela
Penschuck, Manuel
Zhou, Guangyan
RANDOM STRUCTURES & ALGORITHMS, 2021, 58 (04) : 609 - 647
[10] A note on random 2-SAT with prescribed literal degrees
Cooper, C
Frieze, A
Sorkin, GB
PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 316 - 320