Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics - Peter Burgisser - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783540667520 - June 21, 2000
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 2000 edition

Price
HK$ 962
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 2 - 14

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;

186 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released June 21, 2000
ISBN13 9783540667520
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 168
Dimensions 165 × 244 × 12 mm   ·   435 g
Language French  

More by Peter Burgisser

Show all

Mere med samme udgiver

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