Increasing Kolmogorov complexity

被引：0

|

作者：

Buhrman, H ^{[1
]}

Fortnow, L

Newman, I

Vereshchagin, N

机构：

[1] CWI, NL-1009 AB Amsterdam, Netherlands

[2] Univ Amsterdam, ILLC, Amsterdam, Netherlands

[3] Univ Chicago, Dept Comp Sci, Chicago, IL 60637 USA

[4] Univ Haifa, Dept Comp Sci, IL-31999 Haifa, Israel

[5] Moscow MV Lomonosov State Univ, Moscow, Russia

来源：

STACS 2005, PROCEEDINGS | 2005年 / 3404卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：412 / 421

页数：10

相关论文

共 50 条

[1] List Approximation for Increasing Kolmogorov Complexity
Zimand, Marius
AXIOMS, 2021, 10 (04)
[2] List Approximation for Increasing Kolmogorov Complexity
Zimand, Marius
34TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2017), 2017, 66
[3] Kolmogorov complexity
Fortnow, L
ASPECTS OF COMPLEXITY: MINICOURSES IN ALGORITHMICS, COMPLEXITY AND COMPUTATIONAL ALGEBRA, 2001, 4 : 73 - 86
[4] Kolmogorov complexity
Mosterín, J
COMPLEXITY AND EMERGENCE, 2002, : 45 - 56
[5] Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
Zimand, Marius
THEORY OF COMPUTING SYSTEMS, 2010, 46 (04) : 707 - 722
[6] Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
Marius Zimand
Theory of Computing Systems, 2010, 46 : 707 - 722
[7] Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
Zimand, Marius
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2008, 5010 : 326 - 338
[8] Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
Bienvenu, Laurent
THEORY OF COMPUTING SYSTEMS, 2010, 46 (03) : 598 - 617
[9] Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
Laurent Bienvenu
Theory of Computing Systems, 2010, 46 : 598 - 617
[10] Kolmogorov-loveland stochasticity and Kolmogorov complexity
Bienvenu, Laurent
STACS 2007, PROCEEDINGS, 2007, 4393 : 260 - 271

← 1 2 3 4 5 →