The Community for Technology Leaders
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science (1993)
Palo Alto, CA, USA
Nov. 3, 1993 to Nov. 5, 1993
ISBN: 0-8186-4370-6
pp: 566-572
A.I. Barvinok , Dept. of Math., R. Inst. of Technol., Stockholm, Sweden
ABSTRACT
We prove that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d=1,2,3, and 4 only.
INDEX TERMS
d-dimensional Euclidean space, polynomial time algorithm, integral points counting, polyhedra
CITATION

A. Barvinok, "A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed," Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science(FOCS), Palo Alto, CA, USA, 1993, pp. 566-572.
doi:10.1109/SFCS.1993.366830
98 ms
(Ver 3.3 (11022016))