Theory of Semi-Feasible Algorithms by Lane A. HemaspaandraTheory of Semi-Feasible Algorithms by Lane A. Hemaspaandra

Theory of Semi-Feasible Algorithms

byLane A. Hemaspaandra, Leen Torenvliet

Paperback | December 9, 2010

Pricing and Purchase Info

$161.53 online 
$191.95 list price save 15%
Earn 808 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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.
Title:Theory of Semi-Feasible AlgorithmsFormat:PaperbackDimensions:150 pages, 23.5 × 15.5 × 0.07 inPublished:December 9, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642075819

ISBN - 13:9783642075810

Look for similar items by category:


Editorial Reviews

From the reviews:"This book focuses mainly on the complexity of P-selective sets . . a course from this text would require a highly-motivated instructor who can give the intuitive ideas leaving the details to the book. The book would also serve as a reasonable reference for those doing research in this area." (Lance Fortnow, SIGACT News, Vol. 35 (2), 2004)