11 search results - page 3 / 3 » A Note on Integer Factorization Using Lattices |
112
Voted
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...