Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration

References

• [1] Barvinok AI (1994) Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Math. Oper. Res. 19(2):769–779.Link, Google Scholar
• [2] Barvinok AI (2008) Integer Points in Polyhedra (European Mathematical Society, Zurich).Crossref, Google Scholar
• [3] Beck M (2000) Counting lattice points by means of the residue theorem. Ramanujan J. 4(3):299–310.Crossref, Google Scholar
• [4] Beck M, Robins S (2007) Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra (Springer-Verlag, New York).Google Scholar
• [5] Björklund A (2012) Counting perfect matchings as fast as Ryser. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms (ACM, New York), 914–921.Google Scholar
• [6] Björklund A, Husfeldt T (2008) Exact algorithms for exact satisfiability and number of perfect matchings. Algorithmica 52(2):226–249.Crossref, Google Scholar
• [7] Brass H, Petras K (2011) Quadrature Theory (American Mathematical Society, Providence, RI).Crossref, Google Scholar
• [8] Brion M, Vergne M (1997) Residue formulae, vector partition functions and lattice points in rational polytopes. J. Amer. Math. Soc. 10(4):797–833.Crossref, Google Scholar
• [9] Cygan M, Pilipczuk M (2015) Faster exponential-time algorithms in graphs of bounded average degree. Inform. Comput. 243:75–85.Crossref, Google Scholar
• [10] De Loera JA, Hemmecke R, Tauzer J, Yoshida R (2004) Effective lattice point counting in rational convex polytopes. J. Symbolic Comput. 38(4):1273–1302.Crossref, Google Scholar
• [11] Diaconis P, Gangolli A (1995) Rectangular arrays with fixed margins. Aldous D, Diaconis P, Spencer J, Steele JM, eds. Discrete Probability and Algorithms (Springer, New York), 15–41.Crossref, Google Scholar
• [12] Izumi T, Wadayama T (2012) A new direction for counting perfect matchings. Proc. 2012 IEEE 53rd Annual Sympos. Foundations Comput. Sci. (IEEE Computer Society, Los Alamitos, CA), 591–598.Google Scholar
• [13] Lasserre JB (2009) Linear and Integer Programming Vs Linear Integration and Counting: A Duality Viewpoint (Springer-Verlag, Berlin).Crossref, Google Scholar
• [14] Lasserre JB, Zeron ES (2003) On counting integral points in a convex rational polytope. Math. Oper. Res. 28(4):853–870.Link, Google Scholar
• [15] Lasserre JB, Zeron ES (2005) An alternative algorithm for counting lattice points in a convex polytope. Math. Oper. Res. 30(3):597–614.Link, Google Scholar
• [16] Ryser HJ (1963) Combinatorial Mathematics (Mathematical Association of America, Washington, DC).Google Scholar
• [17] Trefethen LN, Weideman JAC (2014) The exponentially convergent trapezoidal rule. SIAM Rev. 56(3):385–458.Crossref, Google Scholar
• [18] Valiant LG (1979) The complexity of computing the permanent. Theoret. Comput. Sci. 8(2):189–201.Crossref, Google Scholar