Prerona Chatterjee

Orcid: 0000-0003-2643-8142

Affiliations:
  • Indian Institute of Technology Madras, India
  • Tel Aviv University, Israel (former)


According to our database1, Prerona Chatterjee authored at least 15 papers between 2019 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
IPS Lower Bounds for Formulas and Sum of ROABPs.
CoRR, July, 2025

Lower Bounds from Succinct Hitting Sets.
Electron. Colloquium Comput. Complex., 2025

IPS Lower Bounds for Formulas and Sum of1 ROABPs.
Electron. Colloquium Comput. Complex., 2025

2024
Lower Bounds for Set-Multilinear Branching Programs.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
On Annihilators of Explicit Polynomial Maps.
Electron. Colloquium Comput. Complex., 2023

Exponential Lower Bounds Against Sums of ROABPs.
Electron. Colloquium Comput. Complex., 2023

Monotone Classes Beyond VNP.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

New Lower Bounds Against Homogeneous Non-Commutative Circuits.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Transparency Beyond VNP in the Monotone Setting.
Electron. Colloquium Comput. Complex., 2022

Quadratic Lower Bounds for Algebraic Branching Programs and Formulas.
Comput. Complex., 2022

2021
Generalized parametric path problems.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Separating ABPs and Some Structured Formulas in the Non-Commutative Setting.
Proceedings of the 36th Computational Complexity Conference, 2021

2020
On the Existence of Algebraically Natural Proofs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

A Quadratic Lower Bound for Algebraic Branching Programs.
Proceedings of the 35th Computational Complexity Conference, 2020

2019
Constructing Faithful Homomorphisms over Fields of Finite Characteristic.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019


  Loading...