Chrome Extension
WeChat Mini Program
Use on ChatGLM

On Beating 2^n for the Closest Vector Problem

Amir Abboud, Rajendra Kumar

2025 Symposium on Simplicity in Algorithms (SOSA)(2025)

Cited 0|Views0
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