Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; New York : New York, N.Y., U.S.A. :
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
1988.
|
| Colección: | Annals of discrete mathematics ;
35. |
| Temas: | |
| Acceso en línea: | Texto completo Texto completo Texto completo |
| Sumario: | 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. |
|---|---|
| Notas: | Includes indexes. |
| Descripción Física: | 1 online resource (xiii, 487 pages) |
| Bibliografía: | Includes bibliographical references (pages 453-468). |
| ISBN: | 9780444703569 044470356X 9780080867755 0080867758 1281793132 9781281793133 9786611793135 6611793135 |