Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

53

CORR
2007
Springer

favoriteEmaildiscussreport

85views Education» more CORR 2007»

Polynomial time algorithms to approximate mixed volumes within a simply exponential factor

14 years 10 months ago

Polynomial time algorithms to approximate mixed volumes within a simply exponential factor

Download www.optimization-online.org

Leonid Gurvits

Real-time Traffic

CORR 2007 | Education |

claim paper

Related Content

» A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» The Complexity of PolynomialTime Approximation

» Connection Preemption in MultiClass Networks

» The Complexity of the Covering Radius Problem on Lattices and Codes

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Leonid Gurvits

Comments (0)