|
|||||
|
|
The complexity of the covering radius problem |
|
| Authors: | Venkatesan Guruswami Daniele Micciancio Oded Regev |
| Affiliation: | (1) Department of Computer Science, University of Washington, Seattle, WA, 98195, U.S.A;(2) Department of Computer Science and Engineering, University of California, San Diego La Jolla, CA, 92093, U.S.A;(3) Department of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel |
| Abstract: | |
| Keywords: | Lattices linear codes covering radius approximation algorithms hardness of approximation complexity classes polynomial time hierarchy interactive proofs |
| 本文献已被 SpringerLink 等数据库收录！ | |
