Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2109.04025
Cited By
v1
v2
v3 (latest)
Improved Hardness of BDD and SVP Under Gap-(S)ETH
Information Technology Convergence and Services (ITCS), 2021
9 September 2021
Huck Bennett
Chris Peikert
Yi Tang
Re-assign community
ArXiv (abs)
PDF
HTML
Github
Papers citing
"Improved Hardness of BDD and SVP Under Gap-(S)ETH"
2 / 2 papers shown
Lattice Problems Beyond Polynomial Time
Symposium on the Theory of Computing (STOC), 2022
Divesh Aggarwal
Huck Bennett
Zvika Brakerski
Alexander Golovnev
Rajendra Kumar
Zeyong Li
Spencer James Peters
Noah Stephens-Davidowitz
Vinod Vaikuntanathan
263
10
0
21 Nov 2022
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!
IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022
Divesh Aggarwal
Rajendra Kumar
210
7
0
08 Nov 2022
1
Page 1 of 1
