Searching for "Approximating CVP to Within Almost-Polynomial Factors is NP-Hard." – sorted by Relevance.

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

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

2 documents found, showing 1 through 2.

Approximating-CVP to Within Almost-Polynomial Factors is NP-hard
by I. Dinur, G. Kindler, S. Safra — 1998 — In Proc. 39th IEEE Symp. on Foundations of Computer Science
…Approximating-CVP to Within Almost-Polynomial Factors is NP-hard I. Dinur G. Kindler S…
Cited by 11 (4 self) – Add To MetaCart

Improved Inapproximability of Lattice and Coding Problems with Preprocessing
by Oded Regev — 2003 — IEEE Transactions on Information Theory
… CVP to within almost polynomial factors is NP-hard. The best probabilistic polynomial time…
Cited by 14 (3 self) – Add To MetaCart

Showing 1 through 2.

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