Theories of Computational Complexity
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...
Saved in:
Main Author | |
---|---|
Format | eBook |
Language | English |
Published |
North-Holland
18.08.2011
|
Series | Annals of Discrete Mathematics |
Subjects | |
Online Access | Get full text |
ISBN | 9780444703569 044470356X |
Cover
Summary: | 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. |
---|---|
ISBN: | 9780444703569 044470356X |