Theories of computational complexity [Recurso electrónico] / Christian Calude.
Contributor(s): ScienceDirect (Online service).Material type: Book; Format: electronic Series: Annals of discrete mathematics ; 35.Publisher: 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., 1988Description: 1 online resource.ISBN: 9780444703569; 044470356X.Subject(s): Computational complexity | Fundamentele informatica | Complexité de calcul (Informatique)Genre/Form: Electronic books.Online resources: Texto completo
Bibliography: p. 453-468.
Restringido a usuarios de la UCA
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.