Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics - Peter Burgisser - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642086045 - December 4, 2010
In case cover and title do not match, the title is correct

Peter Burgisser
Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics Softcover reprint of hardcover 1st ed. 2000 edition

Price
A$ 163.49
excl. VAT

Ordered from remote warehouse

Expected delivery Jan 13 - 23, 2026
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:

This is a thorough and comprehensive treatment of the theory of NP-completeness in the framework of algebraic complexity theory. Coverage includes Valiant's algebraic theory of NP-completeness; interrelations with the classical theory as well as the Blum-Shub-Smale model of computation, questions of structural complexity;

168 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released December 4, 2010
ISBN13 9783642086045
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 168
Dimensions 155 × 235 × 9 mm   ·   267 g
Language English  

More by Peter Burgisser

Show all

See all of Peter Burgisser ( e.g. Hardcover Book and Paperback Book )