Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series - Lane A. Hemaspaandra - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642075810 - December 9, 2010
In case cover and title do not match, the title is correct

Lane A. Hemaspaandra
Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series Softcover reprint of the original 1st ed. 2003 edition

Price
₩ 156,600
excl. VAT

Ordered from remote warehouse

Expected delivery Dec 10 - 22
Christmas presents can be returned until 31 January

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Also available as:

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.

160 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 9, 2010
ISBN13 9783642075810
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 150
Dimensions 155 × 235 × 8 mm   ·   231 g
Language English  
Show all

More by Lane A. Hemaspaandra

See all of Lane A. Hemaspaandra ( e.g. Hardcover Book and Paperback Book )