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 Authors: | |
---|---|
Corporate Authors: | |
Published: |
North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,
|
Publisher Address: | Amsterdam ; New York : New York, N.Y., U.S.A. : |
Publication Dates: | 1988. |
Literature type: | eBook |
Language: | English |
Series: |
Annals of discrete mathematics ;
35 |
Subjects: | |
Online Access: |
http://www.sciencedirect.com/science/bookseries/01675060/35 |
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. |
Carrier Form: | 1 online resource (xiii, 487 pages). |
Bibliography: | Includes bibliographical references (pages 453-468). |
ISBN: |
9780444703569 044470356X 9780080867755 0080867758 |
Index Number: | QA267 |
CLC: | O141.3 |