2 problems

0 votes0 replies1 view
Van Emde Boas's NP-hardness conjecture for the shortest vector problem
The shortest vector problem (SVP) asks for a shortest nonzero vector in a lattice, with length measured using a specified norm. Van Emde Boas's conjecture. SVP with respect to the…
Conjectureopencomputational-complexity lattice-algorithmsarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on efficient Gram-matrix decomposition choices for compute-and-forward
Let ${\bf V}$ be the matrix appearing in a decomposition of the Gram matrix, and let $x_i$ denote the associated values. Efficient-algorithm conjecture. Particular choices of…
Conjectureopencompute-and-forward integer-optimization lattice-algorithmsarXiv posted 2 days ago

Van Emde Boas's NP-hardness conjecture for the shortest vector problem