Pastāsti draugiem par šo preci:
Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series Osamu Watanabe Softcover reprint of the original 1st ed. 1992 edition
Kolmogorov Complexity and Computational Complexity - Monographs in Theoretical Computer Science. An EATCS Series
Osamu Watanabe
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.
105 pages, biography
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2011. gada 21. decembris |
| ISBN13 | 9783642777370 |
| Izdevēji | Springer-Verlag Berlin and Heidelberg Gm |
| Lapas | 105 |
| Izmēri | 155 × 235 × 6 mm · 176 g |
| Valoda | Vācu |
| Redaktors | Watanabe, Osamu |
Vairāk no Osamu Watanabe
Rādīt visuVairāk no tā paša izdevēja
Skatīt visus Osamu Watanabe ( piem., Paperback Book )