​
Login / Signup
Rajendra Kumar
ORCID
Publication Activity (10 Years)
Years Active: 2022-2023
Publications (10 Years): 5
Top Topics
Solving Problems
Sparse Matrix
Upper Bound
Np Hardness
Top Venues
CoRR
STOC
FOCS
</>
Publications
</>
Yanlin Chen
,
Yilei Chen
,
Rajendra Kumar
,
Subhasree Patro
,
Florian Speelman
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more.
CoRR
(2023)
Divesh Aggarwal
,
Huck Bennett
,
Zvika Brakerski
,
Alexander Golovnev
,
Rajendra Kumar
,
Zeyong Li
,
Spencer Peters
,
Noah Stephens-Davidowitz
,
Vinod Vaikuntanathan
Lattice Problems beyond Polynomial Time.
STOC
(2023)
Divesh Aggarwal
,
Rajendra Kumar
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms!
FOCS
(2023)
Divesh Aggarwal
,
Huck Bennett
,
Zvika Brakerski
,
Alexander Golovnev
,
Rajendra Kumar
,
Zeyong Li
,
Spencer Peters
,
Noah Stephens-Davidowitz
,
Vinod Vaikuntanathan
Lattice Problems Beyond Polynomial Time.
CoRR
(2022)
Divesh Aggarwal
,
Rajendra Kumar
Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!
CoRR
(2022)