Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

STACS
2005
Springer

favoriteEmaildiscussreport

93views Theoretical Computer Science» more STACS 2005»

Increasing Kolmogorov Complexity

13 years 10 months ago

Increasing Kolmogorov Complexity

Download people.cs.uchicago.edu

Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai

Real-time Traffic

STACS 2005 | Theoretical Computer Science |

claim paper

Related Content

» LowDepth Witnesses are Easy to Find

» Kolmogorov complexity in perspective

» Shannon Information and Kolmogorov Complexity

» Possibilities and impossibilities in Kolmogorov complexity extraction

» Kolmogorov Complexity in Randomness Extraction

» KolmogorovLoveland Stochasticity and Kolmogorov Complexity

» Kolmogorov Complexity in perspective Part I Information Theory and Randomnes

» Reconciling Data Compression and Kolmogorov Complexity

» Scaled Dimension and the Kolmogorov Complexity of TuringHard Sets

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin

Comments (0)