On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension

DOI10.1287/moor.22.3.545zbMath0882.68145OpenAlexW2073356044MaRDI QIDQ4361783

Martin Dyer, Ravindran Kannan

Publication date: 28 October 1997

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5f70ab3f7ea66111ab7cc9238a400bde2882f754

zbMATH Keywords

polynomial-time algorithm

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Column basis reduction and decomposable knapsack problems, Counting lattice vectors, Effective lattice point counting in rational convex polytopes, On lattice point counting in \(\varDelta\)-modular polyhedra, Bias expansion of spatial statistics and approximation of differenced lattice point counts, Enumeration and unimodular equivalence of empty delta-modular simplices, Computing with an algebraic-perturbation variant of Barvinok's algorithm, Enumerating Projections of Integer Points in Unbounded Polyhedra, Non-standard approaches to integer programming, On the complexity of computing Kronecker coefficients, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant, Polyhedral circuits and their applications, A computational study of integer programming algorithms based on Barvinok's rational functions