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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 12,81 gastos de envío desde Canada a Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Attic Books (ABAC, ILAB), London, ON, Canada
Hardcover. Condición: Good. Annals of Discrete Mathematics 35. xii, 487 p. 24 cm. Orange cloth. Some dark marks to exterior. Light wear. Inscribed by author on front free endpaper. Bibliography, index of notations, subject and author index. Nº de ref. del artículo: 133634
Cantidad disponible: 1 disponibles