Theory of Semi-Feasible Algorithms (Hardcover, 2003 ed.)

This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference.  

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Monographs in Theoretical Computer Science. An EATCS Series
Release date:	October 2002
First published:	2003
Authors:	Lane A. Hemaspaandra • Leen Torenvliet
Dimensions:	235 x 155 x 16mm (L x W x T)
Format:	Hardcover
Pages:	150
Edition:	2003 ed.
ISBN-13:	978-3-540-42200-6
Categories:	Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	3-540-42200-5
Barcode:	9783540422006

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!