Tropical Circuit Complexity: Limits of Pure Dynamic Programming
63,55 €
In DP, an optimization problem is broken up into smaller subproblems that are solved recursively. Many classical DP algorithms are pure in that they only use the basic (min,+) or (max,+) operations in their recursion equations.
Jetzt bei Ebay:
![Produktbild - The Limits of Pure Democracy [microform] by W. H. [Paperback] NEUF](https://i.ebayimg.com/thumbs/images/g/2ecAAeSwPVNoVBnx/s-l140.jpg)
![Produktbild - Relaxation Methods for Pure and Mixed Integer Programming Problems [Hardback]](https://i.ebayimg.com/thumbs/images/g/r3YAAeSwrCtoOScf/s-l140.jpg)
![Produktbild - Natural Complexity: A Modeling Handbook (Primers in Complex Systems) [Paperback]](https://i.ebayimg.com/thumbs/images/g/TxcAAeSwNV1oSGw6/s-l140.jpg)
![Produktbild - MATLAB Programming by Daniel Okoh [Paperback] NEUF](https://i.ebayimg.com/thumbs/images/g/en0AAeSwnTNoPiY7/s-l140.jpg)
![Produktbild - Communication Complexity: and Applications by Rao, Anup [Hardback] NEUF](https://i.ebayimg.com/thumbs/images/g/YtkAAeSwYVpn~rRi/s-l140.jpg)
![Produktbild - Effective Theories in Programming Practice by Misra, Jayadev [Paperback] NEUF](https://i.ebayimg.com/thumbs/images/g/MugAAeSwE-9oPbJM/s-l140.jpg)
