Theory of Semi-Feasible Algorithms (Paperback, Softcover reprint of the original 1st ed. 2003)

The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Monographs in Theoretical Computer Science. An EATCS Series
Release date:	December 2010
First published:	2003
Authors:	Lane A. Hemaspaandra • Leen Torenvliet
Dimensions:	235 x 155 x 8mm (L x W x T)
Format:	Paperback
Pages:	150
Edition:	Softcover reprint of the original 1st ed. 2003
ISBN-13:	978-3-642-07581-0
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Computing & IT > Applications of computing > General
LSN:	3-642-07581-9
Barcode:	9783642075810

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!