<--- Back to Details
First PageDocument Content
Operations research / Convex optimization / Lattice points / Combinatorial optimization / Computational number theory / Ellipsoid method / Linear programming / Leonid Khachiyan / Lattice reduction / LenstraLenstraLovsz lattice basis reduction algorithm / Mathematical optimization / Arjen Lenstra
Date: 2012-07-25 10:24:41
Operations research
Convex optimization
Lattice points
Combinatorial optimization
Computational number theory
Ellipsoid method
Linear programming
Leonid Khachiyan
Lattice reduction
LenstraLenstraLovsz lattice basis reduction algorithm
Mathematical optimization
Arjen Lenstra

51 Documenta Math. Linear Programming Stories

Add to Reading List

Source URL: documenta.sagemath.org

Download Document from Source Website

File Size: 227,94 KB

Share Document on Facebook

Similar Documents

51  Documenta Math. Linear Programming Stories

51 Documenta Math. Linear Programming Stories

DocID: 1pZQ7 - View Document

Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé  Universität Wien, Austria

Faster LLL-type reduction of lattice bases Arnold Neumaier Damien Stehlé Universität Wien, Austria

DocID: 1pk3Z - View Document

51  Documenta Math. Linear Programming Stories

51 Documenta Math. Linear Programming Stories

DocID: 1osru - View Document