Approximating-CVP to within almost-polynomial factors is NP-hard
In: Proceedings of 39th Annual Symposium on Foundations of Computer Science; (1998) S. 99-109
Konferenz
Zugriff:
Titel: |
Approximating-CVP to within almost-polynomial factors is NP-hard
|
---|---|
Autor/in / Beteiligte Person: | Dinur, I. ; Kindler, G. ; Safra, S. |
Quelle: | Proceedings of 39th Annual Symposium on Foundations of Computer Science; (1998) S. 99-109 |
Veröffentlichung: | 1998 |
Medientyp: | Konferenz |
ISBN: | 0-8186-9172-7 (print) ; 978-0-8186-9172-0 (print) |
ISSN: | 0272-5428 (print) |
DOI: | 10.1109/SFCS.1998.743433 |
Sonstiges: |
|