Hardness of proving lattice shortest-vector threshold statements
Let a lattice be a discrete subgroup of Euclidean space, and let its shortest nonzero integer vector length be the relevant lattice parameter. Lattice shortest-vector hardness conjecture. Proving that a lattice's shortest integer vector exceeds a threshold is hard.
References
Primary source
Hunter Monroe, “A Proposed Characterization of p-Simulation Between Theories”, arXiv:2507.13576 (2026).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.