• DocumentCode
    2365949
  • Title

    A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

  • Author

    Barvinok, A.I.

  • Author_Institution
    Dept. of Math., R. Inst. of Technol., Stockholm, Sweden
  • fYear
    1993
  • fDate
    3-5 Nov 1993
  • Firstpage
    566
  • Lastpage
    572
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on
  • Conference_Location
    Palo Alto, CA
  • Print_ISBN
    0-8186-4370-6
  • Type

    conf

  • DOI
    10.1109/SFCS.1993.366830
  • Filename
    366830
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2365949