Sagnik Saha

Publication Activity (10 Years)

Years Active: 2021-2024
Publications (10 Years): 9

Top Topics

Randomly Generated

Polynomial Time Complexity

Polynomially Solvable

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Aayush Jain, Huijia Lin, Sagnik Saha
A Systematic Study of Sparse LWE. CRYPTO (3) (2024)
Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan
k-SUM in the Sparse Regime: Complexity and Applications. CRYPTO (2) (2024)
Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan
The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. Electron. Colloquium Comput. Complex. (2023)
Sagnik Saha, Nikolaj Ignatieff Schwartzbach, Prashant Nalini Vasudevan
The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. IACR Cryptol. ePrint Arch. 2023 (2023)
Subinay Adhikary, Sagnik Das, Sagnik Saha, Procheta Sen, Dwaipayan Roy, Kripabandhu Ghosh
Automated Attribute Extraction from Legal Proceedings. CoRR (2023)
Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan
The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. CoRR (2023)
Sagnik Saha, Erik D. Demaine
ZHED is NP-complete. CCCG (2022)
Sagnik Saha, Manish Purohit
NP-completeness of the Active Time Scheduling Problem. CoRR (2021)
Sagnik Saha, Erik D. Demaine
ZHED is NP-complete. CoRR (2021)