|
|
|
|
| LEADER |
01343cam a22004217a 4500 |
| 001 |
BIBLO-28540 |
| 003 |
AR-BaUEN |
| 005 |
20201111150258.0 |
| 008 |
000626s1997 nyu||||f |||| 00| 0|eng|d |
| 040 |
|
|
|a AR-BaUEN
|b spa
|c AR-BaUEN
|
| 020 |
|
|
|a 0387948686
|
| 044 |
|
|
|a xxu
|
| 080 |
|
|
|a 681.332
|
| 100 |
1 |
|
|a Li, Ming
|
| 245 |
1 |
3 |
|a An introduction to Kolmogorov complexity and its applications
|
| 250 |
|
|
|a 2nd. ed.
|
| 260 |
|
|
|a New York :
|b Springer,
|c 1997
|
| 300 |
|
|
|a xiii, 637 p.
|
| 490 |
0 |
|
|a Graduate texts in computer science
|
| 505 |
0 |
0 |
|t Preface to the First Edition
|
| 505 |
0 |
0 |
|t Preface to the Second Edition
|
| 505 |
0 |
0 |
|t Outlines of One-Semester Courses
|
| 505 |
0 |
0 |
|t List of Figures
|
| 505 |
0 |
0 |
|g 1
|t Preliminaries
|
| 505 |
0 |
0 |
|g 2
|t Algorithmic Complexity
|
| 505 |
0 |
0 |
|g 3
|t Algorithmic Prefix Complexity
|
| 505 |
0 |
0 |
|g 4
|t Algorithmic Probability
|
| 505 |
0 |
0 |
|g 5
|t Inductive Reasoning
|
| 505 |
0 |
0 |
|g 6
|t The Incompressibility Method
|
| 505 |
0 |
0 |
|g 7
|t Resource-Bounded Complexity
|
| 505 |
0 |
0 |
|g 8
|t Physics, Information, and Computation
|
| 505 |
0 |
0 |
|t References
|
| 505 |
0 |
0 |
|t Index
|
| 653 |
1 |
0 |
|a ANALISIS DE ALGORITMOS
|
| 653 |
1 |
0 |
|a COMPLEJIDAD DE PROBLEMAS
|
| 700 |
1 |
|
|a Vitányi, Paul
|
| 962 |
|
|
|a info:eu-repo/semantics/book
|a info:ar-repo/semantics/libro
|b info:eu-repo/semantics/publishedVersion
|
| 999 |
|
|
|c 22289
|