Zählen, Abtasten und Integrieren: Algorithmen und Komplexität (Vorlesungen in
79,66 €
1 Two good counting algorithms. - 1.1 Spanning trees. - 1.2 Perfect matchings in a planar graph. - 2 #P-completeness. - 2.1 The class #P. - 2.2 A primal #P-complete problem. - 2.3 Computing the permanent is hard on average.
Jetzt bei Ebay:
![Produktbild - Abstract Recursion and Intrinsic Complexity (Lecture Notes in Logic) [Hardback]](https://i.ebayimg.com/thumbs/images/g/5vEAAOSwM0pm-J3r/s-l140.jpg)
