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

Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series 2003 edition

Lane A. Hemaspaandra

Price
Mex$ 2,534
excl. VAT

Ordered from remote warehouse

Expected delivery Apr 30 - May 13

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:

Theory of Semi-Feasible Algorithms - Monographs in Theoretical Computer Science. An EATCS Series 2003 edition

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.

159 pages, 1 black & white illustrations, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released October 28, 2002
ISBN13 9783540422006
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 150
Dimensions 166 × 241 × 16 mm   ·   358 g
Language German  
Show all

More by Lane A. Hemaspaandra

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