Computing the integer points of a polyhedron. II: Complexity estimates

DOI10.1007/978-3-319-66320-3_18zbMath1455.52012OpenAlexW2751478448MaRDI QIDQ1701489

Rui-Juan Jing, Marc Moreno Maza

Publication date: 23 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66320-3_18

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55) Complexity and performance of numerical algorithms (65Y20)

Uses Software

• Normaliz
• 4ti2

This page was built for publication: Computing the integer points of a polyhedron. II: Complexity estimates