On Beating 2^n for the Closest Vector Problem
2025 Symposium on Simplicity in Algorithms (SOSA)(2025)
AI Read Science
Must-Reading Tree
Example

Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined