Computing with an algebraic-perturbation variant of Barvinok's algorithm
From MaRDI portal
Publication:1707914
DOI10.1016/j.dam.2015.12.003zbMath1396.90049OpenAlexW2214753202MaRDI QIDQ1707914
Publication date: 4 April 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.12.003
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algebraic-perturbation variant of Barvinok's algorithm
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- Integer points in polyhedra
- Computing parametric rational generating functions with a primal Barvinok algorithm
- Residue formulae for vector partitions and Euler-Maclaurin sums.
- Perturbation of transportation polytopes
- Effective lattice point counting in rational convex polytopes
- The Misfortunes of a Trio of Mathematicians Using Computer Algebra Systems. Can We Trust in Them?
- Points entiers dans les polyèdres convexes
- The Generalized Basis Reduction Algorithm
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A Primal Barvinok Algorithm Based on Irrational Decompositions