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
430 Citations
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
  • 5
  • PDF
Sieve algorithms for the shortest vector problem are practical
  • 170
  • Highly Influenced
  • PDF
Fast Lattice Point Enumeration with Minimal Overhead
  • 59
  • PDF
The optimal LLL algorithm is still polynomial in fixed dimension
  • A. Akhavi
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2003
  • 21
An application of simultaneous diophantine approximation in combinatorial optimization
  • 267
  • Highly Influenced
Time-Memory Trade-Off for Lattice Enumeration in a Ball
  • 7
  • Highly Influenced
  • PDF
On the hardness of the shortest vector problem
  • 34
On the expected complexity of integer least-squares problems
  • B. Hassibi, H. Vikalo
  • Mathematics, Computer Science
  • 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 2002
  • 117
  • PDF
BASIS REDUCTION METHODS
  • 4
  • PDF
On Lovász’ lattice reduction and the nearest lattice point problem
  • L. Babai
  • Mathematics, Computer Science
  • Comb.
  • 1986
  • 897
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
The computational complexity of simultaneous Diophantine approximation problems
  • J. Lagarias
  • Computer Science, Mathematics
  • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
  • 151
  • Highly Influential
The computational complexity of simultaneous Diophantine approximation problems
  • 20
  • Highly Influential