Fetching the paper…
Reading the bibliography…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra.
A. I. Barvinok, Computation of exponential integrals, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) Teor. Slozhn. Vychisl. 5 (1991) 149–162, 175–176, translation in J. Math. Sci. 70 (1994), no. 4, 1934–1943
1943
Earlier work this paper cites.
P. Henrici, Applied and computational complex analysis. Vol. 1, Wiley Classics Library, John Wiley & Sons Inc., New York, 1988, power series—integration—conformal mapping—location of zeros, Reprint of the 1974 original, A Wiley-Interscience Publication
1974
Earlier work this paper cites.
doi:10.1007/BF00934543
J. B. Lasserre, An analytical expression and an algorithm for the volume of a convex polyhedron in 𝐑 n \mathbf{R}^{n} , Journal of Optimization Theory and Applications 39 (1983) 363–377, 10.1007/BF00934543 · 1983
Earlier work this paper cites.
G. Elekes, A geometric inequality and the complexity of computing volume, Discrete Comput. Geom. 1 (4) (1986) 289–292
1986
Earlier work this paper cites.
M. E. Dyer, A. M. Frieze, On the complexity of computing the volume of a polyhedron, SIAM J. Comput. 17 (5) (1988) 967–974
1988
Earlier work this paper cites.
M. Brion, Points entiers dans les polyèdres convexes, Ann. Sci. École Norm. Sup. 21 (4) (1988) 653–663
1988
Earlier work this paper cites.
G. Brightwell, P. Winkler, Counting linear extensions, Order 8 (3) (1991) 225–242
1991
Earlier work this paper cites.
J. Lawrence, Polytope volume computation, Math. Comp. 57 (195) (1991) 259–271
1991
Earlier work this paper cites.
B. Li, The moment calculation of polyhedra, Pattern Recognition 26 (8) (1993) 1229–1233
1993
Earlier work this paper cites.
L. Khachiyan, Complexity of polytope volume computation, in: New trends in discrete and computational geometry, Vol. 10 of Algorithms Combin., Springer, Berlin, 1993, pp. 91–101
1993
Earlier work this paper cites.
A. I. Barvinok, Partition functions in optimization and computational problems, Algebra i Analiz 4 (1992) 3–53, translation in St. Petersburg Math. J. 4 (1993), no. 1, pp. 1–49
1993
Earlier work this paper cites.
J. Alexander, A. Hirschowitz, Polynomial interpolation in several variables, J. Algebraic Geom. 4 (1995) 201–222
1995
Earlier work this paper cites.
B. Mirtich, Fast and accurate computation of polyhedral mass properties, Journal of Graphics Tools. 1 (2) (1996) 31–50
1996
Earlier work this paper cites.
B. Sturmfels, Gröbner bases and convex polytopes, Vol. 8 of University Lecture Series, American Mathematical Society, 1996
1996
Earlier work this paper cites.
doi:10.1007/3-540-61576-8_77
K. Fukuda, A. Prodon, Double description method revisited, in: M. Deza, R. Euler, I. Manoussakis (Eds.), Combinatorics and Computer Science, Vol. 1120 of Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 1996, pp. 91–111 · 1996
Earlier work this paper cites.
M. Schechter, Integration over a polyhedron: An application of the Fourier–Motzkin elimination method, American Mathematical Monthly 105 (3) (1998) 246–251
1998
Cited alongside, same era.
A. I. Barvinok, J. E. Pommersheim, An algorithmic theory of lattice points in polyhedra, in: L. J. Billera, A. Björner, C. Greene, R. E. Simion, R. P. Stanley (Eds.), New Perspectives in Algebraic Combinatorics, Vol. 38 of Math. Sci. Res. Inst. Publ., Cambridge Univ. Press, Cambridge, 1999, pp. 91–147
1999
Cited alongside, same era.
D. Avis, lrs: A revised implementation of the reverse search vertex enumeration algorithm, http://cgm.cs.mcgill.ca/~avis/C/lrs.html (1999)
1999
Cited alongside, same era.
B. Büeler, A. Enge, K. Fukuda, Exact volume computation for polytopes: A practical study, in: G. Kalai, G. M. Ziegler (Eds.), Polytopes – Combinatorics and Computation, Vol. 29 of DMV-Seminars, Birkhäuser Verlag, Basel, 2000
2000
Cited alongside, same era.
L. Rademacher, Approximating the centroid is hard, in: Proceedings of 23th annual ACM Symposium of Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, 2007, pp. 302–305
2007
Later among the works it cites.
M. Beck, S. Robins, Computing the continuous discretely: integer-point enumeration in polyhedra, Undergraduate Texts in Mathematics, Springer, 2007
2007
Later among the works it cites.
doi:10.1137/060664768
M. Köppe, A primal Barvinok algorithm based on irrational decompositions, SIAM Journal on Discrete Mathematics 21 (1) (2007) 220–236 · 2007
Later among the works it cites.
A. I. Barvinok, Integer Points in Polyhedra, Zürich Lectures in Advanced Mathematics, European Mathematical Society (EMS), Zürich, Switzerland, 2008
2008
Later among the works it cites.
M. C. Brambilla, G. Ottaviani, On the Alexander–Hirschowitz theorem, Journal of Pure and Applied Algebra 212 (5) (2008) 1229–1251, available at arXiv:math.AG/0701409v2
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
E. Gawrilow, M. Joswig, polymake: a framework for analyzing convex polytopes, in: G. Kalai, G. M. Ziegler (Eds.), Polytopes — Combinatorics and Computation, Birkhäuser, 2000, pp. 43–74
2000
Cited alongside, same era.
G. Hanrot, P. Zimmermann, A long note on Mulders’ short product, Rapport de recherche RR-4654, INRIA, available at http://hal.inria.fr/inria-00071931 (2002)
2002
Cited alongside, same era.
doi:DOI:10.1016/S0965-9978(03)00030-9
H. Ong, H. Huang, W. Huin, Finding the exact volume of a polyhedron, Advances in Engineering Software 34 (6) (2003) 351 – 356 · 2003
Cited alongside, same era.
A. I. Barvinok, K. Woods, Short rational generating functions for lattice point problems, Journal of the AMS 16 (4) (2003) 957–979
2003
Cited alongside, same era.
R. Cools, A. Haegemans, Algorithm 824: CUBPACK: a package for automatic cubature; framework description., ACM Trans. Math. Software 29 (3) (2003) 287–296
2003
Cited alongside, same era.
J. A. De Loera, R. Hemmecke, J. Tauzer, R. Yoshida, Effective lattice point counting in rational convex polytopes, Journal of Symbolic Computation 38 (4) (2004) 1273–1302
2004
Cited alongside, same era.
M. Bronstein, Symbolic Integration I – Transcendental Functions, Vol. 1, Springer, Heidelberg, 2005
2005
Cited alongside, same era.
V. Shoup, NTL, a library for doing number theory, Available from URL http://www.shoup.net/ntl/ (2005)
2005
Cited alongside, same era.
2008
Later among the works it cites.
K. Fukuda, cddlib
2008
Later among the works it cites.
doi:10.1007/s00355-007-0236-1
D. Lepelley, A. Louichi, H. Smaoui, On Ehrhart polynomials and probability calculations in voting theory, Social Choice and Welfare 30 (2008) 363–383 · 2008
Later among the works it cites.
doi:10.1007/s00283-008-9013-y
M. Beck, C. Haase, F. Sottile, Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones, The Mathematical Intelligencer 31 (2009) 9–17, 10.1007/s00283-008-9013-y · 2009
Later among the works it cites.
doi:10.1090/S0025-5718-2010-02378-6
V. Baldoni, N. Berline, J. A. De Loera, M. Köppe, M. Vergne, How to integrate a polynomial over a simplex, Math. Comp. 80 (273) (2011) 297–325 · 2010
Later among the works it cites.
J. De Loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto, J. Wu, A users guide for latte integrale v1.5, Available from URL http://www.math.ucdavis.edu/~latte/ (2011)
2011
Closest in time.
E. Carlini, M. Catalisano, A. Geramita, The solution to Waring’s problem for monomials, eprint arXiv:math.AC/1110.0745v1 (2011)
2011
Closest in time.
G. Ziegler, Database of 0–1 polytopes, http://www.math.tu-berlin.de/polymake/examples/ , accessed: 07/19/2011
2011
Closest in time.
J. De Loera, B. Dutra, M. Köppe, S. Moreinis, G. Pinto, J. Wu, Software for exact integration of polynomials over polyhedra: online supplement, Available from URL http://www.math.ucdavis.edu/~latte/theory/SoftwareExactIntegrationPoly%nomialsPolyhedraOnlineSupplement.pdf (2012)
2012
Closest in time.
A. Schürmann, Exploiting polyhedral symmetries in social choice, Available from URL http://front.math.ucdavis.edu/1109.1545 (2012)
2012
Closest in time.