Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Faster SVP in Polynomial Space
Yansong Feng, Yiming Gao, Jiaqi Liu
Kannan's algorithm, as analyzed by Hanrot and Stehlé in 2007, solves the exact Euclidean shortest vector problem in polynomial space and time. In the classi…
cs.DS2026
Subset Balancing and Generalized Subset Sum via Lattices
Yiming Gao, Yansong Feng, Honggang Hu +1
We study the Subset Balancing problem: given and a coefficient set , find a nonzero vector such that . The st…