A relation of primal-dual lattices and the complexity of shortest lattice vector problem
- 1 October 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 207 (1) , 105-116
- https://doi.org/10.1016/s0304-3975(98)00058-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- New bounds in some transference theorems in the geometry of numbersMathematische Annalen, 1993
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica, 1990
- Dual vectors and lower bounds for the nearest lattice point problemCombinatorica, 1988
- On Lovász’ lattice reduction and the nearest lattice point problemCombinatorica, 1986
- The Computational Complexity of Simultaneous Diophantine Approximation ProblemsSIAM Journal on Computing, 1985
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982