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...
| Main Author: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Amsterdam
North-Holland
1988, 1988
|
| Series: | Annals of discrete mathematics
|
| Subjects: | |
| Online Access: | |
| Collection: | Elsevier eBook collection Mathematics - Collection details see MPG.ReNa |
| 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 |
|---|---|
| Item Description: | Includes indexes. - Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 |
| Physical Description: | xiii, 487 pages |
| ISBN: | 9786611793135 9780080867755 9780444703569 9781281793133 1281793132 044470356X 0080867758 |