Siirry suoraan sisältöön
Completeness and Reduction in Algebraic Complexity Theory
Tallenna

Completeness and Reduction in Algebraic Complexity Theory

In 1989, Blum, Shub, and Smale [12] combined existing algebraic models of computation with the concept of uniformity and developed a theory of NP-completeness over the reals (BSS-model).
Painos
Softcover reprint of hardcover 1st ed. 2000
ISBN
9783642086045
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
4.12.2010
Sivumäärä
168