✦ LIBER ✦

Resource-Bounded Kolmogorov Complexity Revisited

✍ Scribed by Buhrman, Harry; Fortnow, Lance; Laplante, Sophie

Book ID: 118180467
Publisher: Society for Industrial and Applied Mathematics
Year: 2001
Tongue: English
Weight: 229 KB
Volume: 31
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s009753979834388x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The pervasive reach of resource-bounded

The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory

✍ Eric Allender; Michal Koucký; Detlef Ronneburger; Sambuddha Roy 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Modeling Time-Bounded Prefix Kolmogorov

Modeling Time-Bounded Prefix Kolmogorov Complexity

✍ D. W. Juedes; J. H. Lutz 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 96 KB

A Note on polynomial-size circuits with

A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity

✍ Montserrat Hermo; Elvira Mayordomo 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 518 KB

Time-Bounded Kolmogorov Complexity and S

Time-Bounded Kolmogorov Complexity and Solovay Functions

✍ Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 536 KB

Resource bounded randomness and computat

Resource bounded randomness and computational complexity

✍ Yongge Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 165 KB

The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is indepen

On Languages with Very High Space-Bounde

On Languages with Very High Space-Bounded Kolmogorov Complexity

✍ Book, Ronald V.; Lutz, Jack H. 📂 Article 📅 1993 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 968 KB