![Computational complexity theory / Operations research / Analysis of algorithms / Martin Dyer / Polynomial-time algorithm for approximating the volume of convex bodies / Algorithm / Approximation algorithm / Linear programming / Time complexity / Theoretical computer science / Applied mathematics / Mathematics Computational complexity theory / Operations research / Analysis of algorithms / Martin Dyer / Polynomial-time algorithm for approximating the volume of convex bodies / Algorithm / Approximation algorithm / Linear programming / Time complexity / Theoretical computer science / Applied mathematics / Mathematics](https://www.pdfsearch.io/img/f68c4a11df2c87b4c40cd3ab1445cd4c.jpg)
| Document Date: 2013-02-18 11:02:17 Open Document File Size: 62,80 KBShare Result on Facebook
IndustryTerm approximate counting algorithms / polynomial-time algorithm / polynomial-time approximation algorithm / polynomial-time randomised algorithm / chain algorithms / contributed numerous approximate counting algorithms / important applications / knapsack solutions / linear-time algorithms / approximation algorithms / random polynomial-time algorithm / / Organization EATCS Awards Committee / / Person Leslie Ann Goldberg / Martin Dyer Martin Dyer / Martin Dyer / Vladimiro Sassone / Heide / / Position researcher / chair / / PublishedMedium Theoretical Computer Science / / Technology polynomial-time randomised algorithm / polynomial-time approximation algorithm / rapid mixing Markov chain algorithms / approximation algorithms / simulation / linear-time algorithms / developing approximation algorithms / approximate counting algorithms / polynomial-time algorithm / random polynomial-time algorithm / /
SocialTag |