Titel: Theories of Computational Complexity (Volume 35) (Annals of Discrete Mathematics, Volume 35)
Verlag: North Holland
Ver�ffentlichungsdatum: 1988
Sprache: Englisch
ISBN-10: 044470356X
ISBN-13: 9780444703569
Bindung: hardcover
Zustand: Very Good
Buchtyp: book

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.