Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Daqing Wan

Daqing Wan

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

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

Papers

cs.CCmath.NTTheoreticalRecentAug 12, 2026

Euclidean SVP is deterministically NP-hard to approximate within any constant factor

Daqing Wan

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

View →