Title :
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
Author_Institution :
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
Keywords :
computational geometry; d-dimensional Euclidean space; integral points counting; polyhedra; polynomial time algorithm; Algorithm design and analysis; Lattices; Mathematics; Polynomials; Space technology;
Conference_Titel :
Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
Conference_Location :
Palo Alto, CA
Print_ISBN :
0-8186-4370-6
DOI :
10.1109/SFCS.1993.366830
