On average case complexity of SAT for symmetric distribution

被引：0

作者：

机构：

来源：

J Logic Comput | / 1卷 / 71期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[1] Notions of average-case complexity for random 3-SAT
Atserias, A
COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 1 - 5
[2] AVERAGE CASE COMPLEXITY UNDER THE UNIVERSAL DISTRIBUTION EQUALS WORST-CASE COMPLEXITY
MING, L
VITANYI, PMB
INFORMATION PROCESSING LETTERS, 1992, 42 (03) : 145 - 149
[3] Average complexity of symmetric Boolean functions
Chashkin, A.V.
Vestnik Moskovskogo Universiteta. Ser. 1 Matematika Mekhanika, 2003, (01): : 16 - 20
[4] AVERAGE CASE COMPLEXITY
GUREVICH, Y
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 615 - 628
[5] Local search for solving SAT problems and its average time complexity
Liu, Tao
Li, Guojie
Jisuanji Xuebao/Chinese Journal of Computers, 1997, 20 (01): : 18 - 26
[6] Average-case Complexity
Trevisan, Luca
PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 11 - 11
[7] Average-Case Complexity
Bogdanov, Andrej
Trevisan, Luca
FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2006, 2 (01): : 1 - 111
[8] ON THE THEORY OF AVERAGE CASE COMPLEXITY
BENDAVID, S
CHOR, B
GOLDREICH, O
LUBY, M
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1992, 44 (02) : 193 - 219
[9] Structural average case complexity
Schuler, R
Yamakami, T
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 52 (02) : 308 - 327
[10] On the average-case complexity of Boolean functions under binomial distribution on their domains
Chashkin, Aleksandr, V
DISCRETE MATHEMATICS AND APPLICATIONS, 2021, 31 (05): : 315 - 318