scientific article; zbMATH DE number 3906238
From MaRDI portal
Publication:3683901
[For the entire collection see Zbl 0553.00001.] The author sketches an algorithmic theory of combinatorics, geometry and number theory in terms of its main constituents and their interrelations. The constituents are: computational complexity theory, the ellipsoid method for linear programming, polyhedral combinatorics, and algorithms for basis reduction in lattices. A more detailed description will be given in a forthcoming book by M. Grötschel, the author, and A. Schrijver.
Recommendations
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3683901)