Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics - Peter Burgisser - Knjige - Springer-Verlag Berlin and Heidelberg Gm - 9783540667520 - 21. junija 2000
Če se naslovnica in naslov ne ujemata, je naslov pravilen

Completeness and Reduction in Algebraic Complexity Theory - Algorithms and Computation in Mathematics 2000 edition

Cena
€ 112,99

Naročeno iz oddaljenega skladišča

Predvidena dobava 14. - 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;


186 pages, biography

Medij Knjige     Hardcover Book   (Knjiga s trdim hrbtom in platnicami)
Izdano 21. junija 2000
ISBN13 9783540667520
Založniki Springer-Verlag Berlin and Heidelberg Gm
Strani 168
Dimenzije 165 × 244 × 12 mm   ·   435 g
Jezik Francoščina  

Več od Peter Burgisser

Več od istega **izdajatelja**