On average case complexity of SAT for symmetric distribution

被引：0

作者：

机构：

来源：

J Logic Comput | / 1卷 / 71期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[31] More on average case vs approximation complexity
Alekhnovich, M
44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 298 - 307
[32] Average-case quantum query complexity
Ambainis, A
de Wolf, R
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2001, 34 (35): : 6741 - 6754
[33] On the average-case complexity of parameterized clique
Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny
THEORETICAL COMPUTER SCIENCE, 2015, 576 : 18 - 29
[34] Average-case analysis for the MAX-2SAT problem
Watanabe, Osamu
Yamamoto, Masaki
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2006, PROCEEDINGS, 2006, 4121 : 277 - 282
[35] THE AVERAGE-CASE PARALLEL COMPLEXITY OF SORTING
BOPPANA, RB
INFORMATION PROCESSING LETTERS, 1989, 33 (03) : 145 - 146
[36] MORE ON AVERAGE CASE VS APPROXIMATION COMPLEXITY
Alekhnovich, Michael
COMPUTATIONAL COMPLEXITY, 2011, 20 (04) : 755 - 786
[37] Malign Distributions for Average Case Circuit Complexity
Inst. für Theor. Informatik, Med. Universität zu Lübeck, Wallstraße 40, 23560 Lübeck, Germany
Inf Comput, 2 (187-208):
[38] Average-Case Information Complexity of Learning
Nachum, Ido
Yehudayoff, Amir
ALGORITHMIC LEARNING THEORY, VOL 98, 2019, 98
[39] Average-case analysis for the MAX-2SAT problem
Watanabe, Osamu
Yamamoto, Masaki
THEORETICAL COMPUTER SCIENCE, 2010, 411 (16-18) : 1685 - 1697
[40] A THEORY OF LEARNING SIMPLE CONCEPTS UNDER SIMPLE DISTRIBUTIONS AND AVERAGE CASE COMPLEXITY FOR THE UNIVERSAL DISTRIBUTION
LI, M
VITANYI, PMB
30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 34 - 39

← 1 2 3 4 5 →