Daqing Wan
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Number Theory×1
Research Timeline
2026
Euclidean SVP is deterministically NP-hard to approximate within any constant factor
The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.
Highlighted terms show continued research focus across papers