Short Vectors (SV)
Category: Formal Languages
Input
Input vectors $a_1, \ldots, a_n \in \Z^n$ that are linearly independent over $\Q$.
Problem
Find a nonzero vector $x$ in the $\Z$-module (or “lattice”) $M = \sum a_i \Z \subseteq \Z^n$ such that $|x| \leq 2^{(n-1)/2} |y|$ for all $y \in M - \{\vec{0}\}$, where $|y| = \left(\sum y_i^2\right)^{1/2}$ is the $L_2$ norm.
Status
Open (von zur Gathen [1]).
Remarks
Lenstra, Lenstra, and Lovász show that the problem is in $\P$ [2]. IntegerGCD is $\NC^1$ reducible to SV [1]. For additional remarks about related problems, see Bachem and Kannan [3].
References
- J. von zur Gathen (1984). Parallel algorithms for algebraic problems.
- A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász (1982). Factoring polynomials with rational coefficients.
- A. Bachem and R. Kannan (1984). Lattices and the basis reduction algorithm.
- Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. (1995). Limits to Parallel Computation: P-Completeness Theory. Oxford University Press. Problem B.7.1.