Theories of Computational Complexity
C. Calude
Ago 2011 · Annals of Discrete Mathematics Kitabu cha 35 · Elsevier
Kitabu pepe
486
Kurasa
family_home
Kimetimiza masharti
info
reportUkadiriaji na maoni hayajahakikishwa Pata Maelezo Zaidi
Kuhusu kitabu pepe hiki
This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance. The book includes a wealth of results - classical, recent, and others which have not been published before.In developing the mathematics underlying the size, dynamic and structural complexity measures, various connections with mathematical logic, constructive topology, probability and programming theories are established. The facts are presented in detail. Extensive examples are provided, to help clarify notions and constructions. The lists of exercises and problems include routine exercises, interesting results, as well as some open problems.
Kadiria kitabu pepe hiki
Tupe maoni yako.
Kusoma maelezo
Simu mahiri na kompyuta vibao
Sakinisha programu ya Vitabu vya Google Play kwa ajili ya Android na iPad au iPhone. Itasawazishwa kiotomatiki kwenye akaunti yako na kukuruhusu usome vitabu mtandaoni au nje ya mtandao popote ulipo.
Kompyuta za kupakata na kompyuta
Unaweza kusikiliza vitabu vilivyonunuliwa kwenye Google Play wakati unatumia kivinjari cha kompyuta yako.
Visomaji pepe na vifaa vingine
Ili usome kwenye vifaa vya wino pepe kama vile visomaji vya vitabu pepe vya Kobo, utahitaji kupakua faili kisha ulihamishie kwenye kifaa chako. Fuatilia maagizo ya kina ya Kituo cha Usaidizi ili uhamishe faili kwenye visomaji vya vitabu pepe vinavyotumika.
