• DOI:10.1145/800061.808749
Corpus ID: 18181112

Improved algorithms for integer programming and related lattice problems

@inproceedings{Kannan1983ImprovedAF,
  title={Improved algorithms for integer programming and related lattice problems},
  author={R. Kannan},
  booktitle={STOC '83},
  year={1983}
}

• R. Kannan
• Published in STOC '83 1983
• Mathematics, Computer Science

The integer programming problem is: Given m×n and m×l matrices A and b respectively of integers, find whether, there exists an all integer n×l vector x satisfying the m inequalities A×≤b. In settling an important open problem, Lenstra (1981) showed in an elegant way that when n, the number of dimensions is fixed, there is a polynomial-time algorithm to solve this problem. His algorithm achieves a running-time of 0(cn3•p(length of data)) where p is some polynomial and c a constant independent of… Expand

View on ACM

csie.nuk.edu.tw

Save to Library

Create Alert

Cite

Launch Research Feed