Improved Bounds for Sampling Solutions of Random CNF Formulas

被引：0

作者：

He, Kun ^{[1
]}

Wu, Kewen ^{[2
]}

Yang, Kuan ^{[3
]}

机构：

[1] Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China

[2] Univ Calif Berkeley, Berkeley, CA 94720 USA

[3] Shanghai Jiao Tong Univ, John Hoperoft Ctr Comp Sci, Shanghai, Peoples R China

来源：

PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA | 2023年

基金：

中国国家自然科学基金;

关键词：

WALKSAT;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Let Phi be a random k-CNF formula on n variables and m clauses, where each clause is a disjunction of k literals chosen independently and uniformly. Our goal is, for most Phi, to (approximately) uniformly sample from its solution space. Let alpha = m/n be the density. The previous best algorithm runs in time n(poly(k,alpha)) for any alpha less than or similar to 2(k/300) [Galanis, Goldberg, Guo, and Yang, SIAM J. Comput.'21]. In contrast, our algorithm runs in almost-linear time for any alpha less than or similar to 2(k/3).

引用

页码：3330 / 3361

页数：32

共 50 条

[21] ON THE DIAMETER OF THE SET OF SATISFYING ASSIGNMENTS IN RANDOM SATISFIABLE k-CNF FORMULAS
Feige, Uriel
Flaxman, Abraham D.
Vilenchik, Dan
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2011, 25 (02) : 736 - 749
[22] Solving Random Satisfiable 3CNF Formulas in Expected Polynomial Time
Krivelevich, Michael
Vilenchik, Dan
PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 454 - +
[23] Witnesses for non-satisfiability of dense random 3CNF formulas
Feige, Uriel
Kim, Jeong Han
Ofek, Eran
47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 497 - 506
[24] Improved bounds for sampling contingency tables
Morris, BJ
RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (02) : 135 - 146
[25] Generalizations of matched CNF formulas
Stefan Szeider
Annals of Mathematics and Artificial Intelligence, 2005, 43 : 223 - 238
[26] Linear CNF formulas and satisfiability
Porschen, Stefan
Speckenmeyer, Ewald
Zhao, Xishun
DISCRETE APPLIED MATHEMATICS, 2009, 157 (05) : 1046 - 1068
[27] Maximal Satisfiable CNF Formulas
Porschen, Stefan
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, IMECS 2012, VOL I, 2012, : 240 - 245
[28] Generalizations of matched CNF formulas
Szeider, S
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2005, 43 (1-4) : 223 - 238
[29] Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
Doerr, Benjamin
Neumann, Frank
Sutton, Andrew M.
ALGORITHMICA, 2017, 78 (02) : 561 - 586
[30] Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
Benjamin Doerr
Frank Neumann
Andrew M. Sutton
Algorithmica, 2017, 78 : 561 - 586

← 1 2 3 4 5 →