Abstract
Let K be a polyhedron in \({{{\mathbb R}}}^d\), given by a system of m linear inequalities, with rational number coefficients bounded over in absolute value by L. In this series of two papers, we propose an algorithm for computing an irredundant representation of the integer points of K, in terms of “simpler” polyhedra, each of them having at least one integer point. Using the terminology of W. Pugh: for any such polyhedron P, no integer point of its grey shadow extends to an integer point of P. We show that, under mild assumptions, our algorithm runs in exponential time w.r.t. d and in polynomial w.r.t m and L. We report on a software experimentation. In this series of two papers, the first one presents our algorithm and the second one discusses our complexity estimates.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
To be precise, in the EXP complexity class.
- 2.
The notions of real shadow, dark shadow and grey shadow are presented in Sect. 3 of the first paper.
References
4ti2 team. 4ti2–a software package for algebraic, geometric and combinatorial problems on linear spaces. www.4ti2.de
Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. J. Symb. Comput. 28, 105–124 (1999)
Bruns, W., Ichim, B., Römer, T., Sieg, R., Söger, C.: Normaliz. Algorithms for rational cones and affine monoids. https://www.normaliz.uni-osnabrueck.de
Chen, C., Davenport, J.H., May, J.P., Moreno Maza, M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. J. Symb. Comput. 49, 3–26 (2013)
Imbert, J.-L.: Fourier’s elimination: which to choose? pp. 117–129 (1993)
Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the Sixteenth Annual ACM Aymposium on Theory of Computing. STOC 1984, pp. 302–311. ACM, New York, NY, USA (1984)
Khachiyan, L.: Fourier-motzkin elimination method. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1074–1077. Springer, Heidelberg (2009). doi:10.1007/978-0-387-74759-0_187
Motzkin, T.S.: Beiträge zur Theorie der linearen Ungleichungen. Azriel Press, Jerusalem (1936)
Pugh, W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. In: Martin, J.L. (ed.), Proceedings Supercomputing 1991, Albuquerque, NM, USA, 18–22 November 1991, pp. 4–13. ACM (1991)
Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)
Acknowledgements
The authors would like to thank IBM Canada Ltd (CAS project 880) and NSERC of Canada (CRD grant CRDPJ500717-16), as well as the University of Chinese Academy of Sciences, UCAS Joint PhD Training Program, for supporting their work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Jing, RJ., Moreno Maza, M. (2017). Computing the Integer Points of a Polyhedron, II: Complexity Estimates. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2017. Lecture Notes in Computer Science(), vol 10490. Springer, Cham. https://doi.org/10.1007/978-3-319-66320-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-66320-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66319-7
Online ISBN: 978-3-319-66320-3
eBook Packages: Computer ScienceComputer Science (R0)