LOWER BOUNDS BY KOLMOGOROV-COMPLEXITY

被引：0

|

作者：

LI, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 194卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：383 / 393

页数：11

相关论文

共 50 条

[21] LOWER BOUNDS OF THE COMPLEXITY OF LINEAR ALGEBRAS
BINI, D
CAPOVANI, M
INFORMATION PROCESSING LETTERS, 1979, 9 (01) : 46 - 47
[22] LOWER COMPLEXITY BOUNDS FOR POSITIVE CONTACTOMORPHISMS
Dahinden, Lucas
ISRAEL JOURNAL OF MATHEMATICS, 2018, 224 (01) : 367 - 383
[23] LOWER BOUNDS ON THE COMPLEXITY OF LOCAL CIRCUITS
JUKNA, SP
LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 440 - 448
[24] Lower complexity bounds for positive contactomorphisms
Lucas Dahinden
Israel Journal of Mathematics, 2018, 224 : 367 - 383
[25] Lower bounds for quantum communication complexity
Klauck, Hartmut
SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 20 - 46
[26] Lower complexity bounds for lifted inference
Jaeger, Manfred
THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2015, 15 : 246 - 263
[27] Tight Lower Bounds for the Complexity of Multicoloring
Bonamy, Marthe
Kowalik, Lukasz
Pilipczuk, Michal
Socala, Arkadiusz
Wrochna, Marcin
ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (03)
[28] Propositional lower bounds: Algorithms and complexity
Marco Cadoli
Luigi Palopoli
Francesco Scarcello
Annals of Mathematics and Artificial Intelligence, 1999, 27 : 129 - 148
[29] On lower bounds for the complexity of polynomials and their multiples
Baur, W
Halupczok, K
COMPUTATIONAL COMPLEXITY, 1999, 8 (04) : 309 - 315
[30] On lower bounds for the complexity of polynomials and their multiples
W. Baur
K. Halupczok
computational complexity, 1999, 8 : 309 - 315

← 1 2 3 4 5 →