A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 38, 566-572
- https://doi.org/10.1109/sfcs.1993.366830
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Pick′s Theorem and the Todd Class of a Toric VarietyAdvances in Mathematics, 1993
- On integer points in polyhedraCombinatorica, 1992
- Computing the volume, counting integral points, and exponential sumsPublished by Association for Computing Machinery (ACM) ,1992
- On Counting Lattice Points in PolyhedraSIAM Journal on Computing, 1991
- Geometric Algorithms and Combinatorial OptimizationPublished by Springer Nature ,1988
- Points entiers dans les polyèdres convexesAnnales Scientifiques de lʼÉcole Normale Supérieure, 1988
- Enumerative CombinatoricsPublished by Springer Nature ,1986
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983