Author:
De Loera Jesús A.,Haws David C.,Köppe Matthias
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference42 articles.
1. Barvinok, A.I.: Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19, 769–779 (1994)
2. Barvinok, A.I.: Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75(255), 1449–1466 (2006) (electronic)
3. Math. Sci. Res. Inst. Publ.;A.I. Barvinok,1999
4. Barvinok, A.I., Woods, K.: Short rational generating functions for lattice point problems. J. AMS 16(4), 957–979 (2003)
5. Beck, M., Robins, S.: Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Springer, Berlin (2007)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Valuative invariants for large classes of matroids;Journal of the London Mathematical Society;2024-09
2. Lattice points in slices of prisms;Canadian Journal of Mathematics;2024-03-08
3. Ehrhart theory of paving and panhandle matroids;Advances in Geometry;2023-10-01
4. On the Ehrhart Polynomial of Schubert Matroids;Discrete & Computational Geometry;2023-06-08
5. Hepp’s bound for Feynman graphs and matroids;Annales de l’Institut Henri Poincaré D;2022-12-29