Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics - Peter Burgisser - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783642086045 - 4. decembra 2010
Če se naslovnica in naslov ne ujemata, je naslov pravilen

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

Cena
€ 96,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 20. - 28. okt
Prejemajte obvestila o novih izdajah izvajalca Peter Burgisser
Dodaj na svoj seznam želja iMusic

Not rated yet

Na voljo tudi kot:

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

Medij Knjige     Paperback Book   (Knjiga z mehkimi platnicami in lepljenim hrbtom)
Izdano 4. decembra 2010
ISBN13 9783642086045
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 168
Dimenzije 155 × 235 × 9 mm   ·   267 g
Jezik Angleščina  

Več od Peter Burgisser

Več od istega **izdajatelja**