An algebraic-perturbation variant of Barvinok's algorithm

DOI10.1016/j.endm.2015.07.004zbMath1347.05088OpenAlexW2220230152MaRDI QIDQ324705

Jon Lee, Daphne E. Skipper

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.004

zbMATH Keywords

polyhedrongenerating functionintegerBarvinok's algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Signed and weighted graphs (05C22)

Related Items (1)

Computing with an algebraic-perturbation variant of Barvinok's algorithm

Cites Work

• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Unnamed Item
• Unnamed Item

This page was built for publication: An algebraic-perturbation variant of Barvinok's algorithm