Follow
Pranjal Dutta
Pranjal Dutta
Postdoctoral Reseacher at School of Computing, NUS
Verified email at nus.edu.sg - Homepage
Title
Cited by
Cited by
Year
Discovering the roots: Uniform closure results for algebraic classes under factoring
P Dutta, N Saxena, A Sinhababu
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
222018
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
P Dutta, P Dwivedi, N Saxena
arXiv preprint arXiv:2304.11325, 2023
162023
Demystifying the border of depth-3 algebraic circuits
P Dutta, P Dwivedi, N Saxena
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
132022
A largish sum-of-squares implies circuit hardness and derandomization
P Dutta, N Saxena, T Thierauf
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
92021
Weak-keys and key-recovery attack for
P Dutta, MS Rajasree, S Sarkar
Scientific Reports 12 (1), 16313, 2022
62022
Discovering the roots: Uniform closure results for algebraic classes under factoring
P Dutta, N Saxena, A Sinhababu
ACM Journal of the ACM (JACM) 69 (3), 1-39, 2022
52022
Discovering the roots: Unifying and extending results on multivariate polynomial factoring in algebraic complexity
P Dutta
Master's thesis, Chennai Mathematical Institute, 2018
52018
Algebraic algorithms for variants of subset sum
P Dutta, MS Rajasree
Conference on Algorithms and Discrete Applied Mathematics, 237-251, 2022
42022
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits
P Dutta, N Saxena
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
32022
Real -Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization
P Dutta
International Computer Science Symposium in Russia, 78-101, 2021
32021
Arithmetic circuit complexity of division and truncation
P Dutta, G Jindal, A Pandey, A Sinhababu
36th Computational Complexity Conference (CCC 2021), 2021
32021
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT
P Dutta, N Saxena, T Thierauf
Electronic Colloquium on Computational Complexity (ECCC) 27, 39, 2020
32020
De-bordering and Geometric Complexity Theory for Waring rank and related models
P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov
arXiv preprint arXiv:2211.07055, 2022
22022
A tale of hardness, de-randomization and de-bordering in complexity theory
P Dutta
PhD Thesis, 2022
22022
Efficient reductions and algorithms for variants of Subset Sum
P Dutta, MS Rajasree
arXiv preprint arXiv:2112.11020, 2021
22021
Lower-bounding the sum of 4th-powers of univariates leads to derandomization and hardness
P Dutta, N Saxena
URL: https://www. cse. iitk. ac. in/users/nitin/papers/4th-powers. pdf, 2020
22020
Border complexity via elementary symmetric polynomials.
P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov
arXiv preprint arXiv:2211.07055, 2022
12022
On the hardness of monomial prediction and zero-sum distinguishers for Ascon
P Dutta, MS Rajasree, S Sarkar
12𝑡ℎ International Workshop on Coding and Cryptography (WCC’22), 2022
12022
Fixed-parameter debordering of Waring rank
P Dutta, F Gesmundo, C Ikenmeyer, G Jindal, V Lysikov
arXiv preprint arXiv:2401.07631, 2024
2024
On the power of border width-2 ABPs over fields of characteristic 2
P Dutta, C Ikenmeyer, B Komarath, H Mittal, S Nanoti, D Thakkar
Leibniz International Proceedings in Informatics (LIPIcs), 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20