On the expected complexity of integer least-squares problems

@article{Hassibi2002OnTE,
  title={On the expected complexity of integer least-squares problems},
  author={Babak Hassibi and Haris Vikalo},
  journal={2002 IEEE International Conference on Acoustics, Speech, and Signal Processing},
  year={2002},
  volume={2},
  pages={II-1497-II-1500}
}
The problem of finding the least-squares solution to a system of linear equations where the unknown vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, arises in many applications: communications, cryptography, GPS, to name a few. The problem is equivalent to finding the closest lattice point to a given point and is known to be NP-hard. In communications applications, however, the given vector is not arbitrary, but rather is an unknown… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 177 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 80 citations

177 Citations

0102030'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Euclidean space lattice decoding for joint detection in CDMA systems;

  • C. Brutel, 1. Boutros
  • in Proc. 0/ the J 999 IEEE In/o. Thy. and Comm…
  • 1999
1 Excerpt

Geometrical AI­ gon'thms and Combinatorial Optimization

  • M. Grotschel, L. Lovasz, A. Schrijver
  • 1993
2 Excerpts