Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
Home
Publications
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
Authors:
ID
I. Dinur
I. Dinur
GK
G. Kindler
G. Kindler
RR
R. Raz
R. Raz
SS
S. Safra
S. Safra
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 April 2003
journal article
Published by
Springer Nature
in
Combinatorica
Vol. 23
(2)
,
205-243
DOI:
10.1007/s00493-003-0019-y
Abstract
No abstract available
Keywords
FACTOR NC
CONSTANT C
LOG LOG N
N-DIMENSIONAL LATTICE
ALMOST-POLYNOMIAL FACTORS
CLOSEST VECTOR
APPROXIMATING CVP
COMPUTATIONAL COMPLEXITY
CRYPTOGRAPHY
CVP
LATTICES
LATTICE
POLYNOMIALS
APPROXIMATION
VECTORS
NP HARD
POLYNOMIAL FACTORIZATION
NP COMPLETE PROBLEM
Cited
Cited by 178 articles
Scroll to top