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 条

[1] Lower bounds using Kolmogorov complexity
Laplante, Sophie
LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 297 - 306
[2] Detection of unknown DoS attacks by Kolmogorov-complexity fluctuation
Furuya, T
Matsuzaki, T
Matsuura, K
INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2005, 3822 : 395 - 406
[3] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
Laplante, S
Magniez, F
19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 294 - 304
[4] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
Laplante, Sophie
Magniez, Frederic
SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 46 - 62
[5] CIRCUIT LOWER BOUNDS A LA KOLMOGOROV
FORTNOW, L
LAPLANTE, S
INFORMATION AND COMPUTATION, 1995, 123 (01) : 121 - 126
[6] ARE LOWER BOUNDS ON THE COMPLEXITY LOWER BOUNDS FOR UNIVERSAL CIRCUITS
NIGMATULLIN, RG
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 331 - 340
[7] Lower Bounds for Reducibility to the Kolmogorov Random Strings
Hitchcock, John M.
PROGRAMS, PROOFS, PROCESSES, 2010, 6158 : 195 - 200
[8] Refined Bounds on Kolmogorov Complexity for omega-Languages
Mielke, Joeran
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 221 (181-189) : 181 - 189
[9] Lower Bounds in Communication Complexity
Lee, Troy
Shraibman, Adi
FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2007, 3 (04): : 263 - 399
[10] LOWER BOUNDS FOR THE APPROXIMATIVE COMPLEXITY
GRIESSER, B
THEORETICAL COMPUTER SCIENCE, 1986, 46 (2-3) : 329 - 338

← 1 2 3 4 5 →