Pranjal Dutta

Orcid: 0000-0001-9137-9025

According to our database1, Pranjal Dutta authored at least 17 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Power of Border Width-2 ABPs over Fields of Characteristic 2.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Fixed-Parameter Debordering of Waring Rank.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Homogeneous Algebraic Complexity Theory and Algebraic Formulas.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023
Efficient Reductions and Algorithms for Subset Product.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

2022
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring.
J. ACM, 2022

Border complexity via elementary symmetric polynomials.
Electron. Colloquium Comput. Complex., 2022

Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Algebraic Algorithms for Variants of Subset Sum.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021
Arithmetic Circuit Complexity of Division and Truncation.
Electron. Colloquium Comput. Complex., 2021

Efficient reductions and algorithms for variants of Subset Sum.
CoRR, 2021

A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Demystifying the border of depth-3 algebraic circuits.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization.
Proceedings of the Computer Science - Theory and Applications, 2021

Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT.
Electron. Colloquium Comput. Complex., 2020

2017
A note on faithful coupling of Markov chains.
CoRR, 2017

2015
Modular Inversion Hidden Number Problem- A Lattice Approach.
IACR Cryptol. ePrint Arch., 2015


  Loading...