Theories of computational complexity: Includes indexes
Saved in:
Bibliographic Details
Format: Electronic eBook
Language:English
Published: Amsterdam North-Holland 1988
Series:Annals of discrete mathematics 35
Subjects:
Online Access:Volltext
Item Description: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
Includes bibliographical references (p. 453-468)
Physical Description:1 Online-Ressource (1 online resource (xiii, 487 p.))
ISBN:9780444703569
044470356X

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Get full text