MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The complexity of the covering radius problem." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

The complexity of the covering radius problem
by Venkatesan Guruswami, Daniele Micciancio, Oded Regev — 2005 — Computational Complexity
…THE COMPLEXITY OF THE COVERING RADIUS PROBLEM Venkatesan Guruswami, Daniele Micciancio, and Oded…
Cited by 2 (1 self) – Add To MetaCart

The Complexity of the Covering Radius Problem on Lattices and Codes
by Venkatesan Guruswami, Daniele Micciancio, Oded Regev
…The Complexity of the Covering Radius Problem on Lattices and Codes Venkatesan Guruswami # Daniele…
Cited by 2 (1 self) – Add To MetaCart

Worst-case to average-case reductions based on Gaussian measures
by Daniele Micciancio, Oded Regev — 2004 — SIAM J. on Computing
… of the complexity of the covering radius problem.) Beside the fact that all known hardness results are only…
Cited by 18 (6 self) – Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB