On the complexity of finding short vectors in integer lattices
- 1 January 1983
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The computational complexity of simultaneous Diophantine approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- A polynomial-time reduction from bivariate to univariate integral polynomial factorizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Schnelle Multiplikation großer ZahlenComputing, 1971