Counting with rational generating functions
Journal of Symbolic Computation
Integer Polyhedra for Program Analysis
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Software for exact integration of polynomials over polyhedra
ACM Communications in Computer Algebra
Probabilistic symbolic execution
Proceedings of the 2012 International Symposium on Software Testing and Analysis
Software for exact integration of polynomials over polyhedra
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We introduce variants of Barvinok’s algorithm for counting lattice points in polyhedra. The new algorithms are based on irrational signed decomposition in the primal space and the construction of rational generating functions for cones with low index. We give computational results that show that the new algorithms are faster than the existing algorithms by a large factor.