Completeness and Reduction in Algebraic Complexity Theory by Peter B?rgisser (En
126,24 €
The theory of NP-completeness is a cornerstone of computational complexity. 1 Introduction. - 2 Valiant's Algebraic Model of NP-Completeness. - 4 Cook's versus Valiant's Hypothesis. - 5 The Structure of Valiant's Complexity Classes.
Jetzt bei Ebay:
