|
" Kolmogorov Complexity and Computational Complexity "
edited by Osamu Watanabe.
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
731252
|
| Doc. No
|
:
|
b551038
|
| Main Entry
|
:
|
edited by Osamu Watanabe.
|
| Title & Author
|
:
|
Kolmogorov Complexity and Computational Complexity\ edited by Osamu Watanabe.
|
| Publication Statement
|
:
|
Berlin, Heidelberg: Springer Berlin Heidelberg, 1992
|
| Series Statement
|
:
|
EATCS monographs on theoretical computer science.
|
| Page. NO
|
:
|
(VII, 105 pages)
|
| ISBN
|
:
|
364277735X
|
|
|
:
|
: 3642777376
|
|
|
:
|
: 9783642777356
|
|
|
:
|
: 9783642777370
|
| Contents
|
:
|
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.
|
| Abstract
|
:
|
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.
|
| Subject
|
:
|
Combinatorial analysis.
|
| Subject
|
:
|
Computer science.
|
| Subject
|
:
|
Computer software.
|
| LC Classification
|
:
|
QA267.7E358 1992
|
| Added Entry
|
:
|
Osamu Watanabe
|
| |