عنوان
پدید آورنده
موضوع
رده
QA267.7 E358 1992
QA267
.
7
E358
1992
کتابخانه
محل استقرار
364277735X
3642777376
9783642777356
9783642777370
b551038
Kolmogorov Complexity and Computational Complexity
[Book]
edited by Osamu Watanabe.
Berlin, Heidelberg
Springer Berlin Heidelberg
1992
(VII, 105 pages)
EATCS monographs on theoretical computer science.
Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory --;On Sets with Small Information Content --;Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness --;Resource Bounded Kolmogorov Complexity and Statistical Tests --;Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity.
The mathematical theory of computation has given rise to two important ap- proaches to the informal notion of "complexity": Kolmogorov complexity, usu- ally a complexity measure for a single object such as a string, a sequence etc., measures the amount of information necessary to describe the object.
Combinatorial analysis.
Computer science.
Computer software.
QA267
.
7
E358
1992
edited by Osamu Watanabe.
Osamu Watanabe
مطالعه متن کتاب [Book]
Y
