On the expected complexity of integer least-squares problems - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Babak Hassibi, Haris Vikalo. On the expected complexity of integer least-squares problems. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2002, May 13-17 2002, Orlando, Florida, USA. pages 1497-1500, IEEE, 2002. [doi]

The following publications are possibly variants of this publication:

Expected complexity of sphere decoding for sparse integer least-square problemsSomsubhra Barik, Haris Vikalo. icassp 2013: 4668-4672 [doi]

Maximum-likelihood decoding and integer least-squares: The expected complexityBabak Hassibi, Haris Vikalo. dimacs 2003: 161-192

runs on WebDSL