The Complexity of the Covering Radius Problem on Lattices and Codes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Venkatesan Guruswami, Daniele Micciancio, Oded Regev. The Complexity of the Covering Radius Problem on Lattices and Codes. In 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21-24 June 2004, Amherst, MA, USA. pages 161-173, IEEE Computer Society, 2004. [doi]

This author has not been identified. Look up 'Venkatesan Guruswami' in GoogleThis author has not been identified. Look up 'Daniele Micciancio' in GoogleThis author has not been identified. Look up 'Oded Regev' in Google

runs on WebDSL