Completeness and Reduction in Algebraic Complexity Theory by Peter B?rgisser (En
121,46 €
One of the most important and successful theories in computational complex ity is that of NP-completeness. Turing machines formalize al gorithms which operate on finite strings of symbols over a finite alphabet.
Jetzt bei Ebay:
