Abhranil Chatterjee

Orcid: 0000-0001-7855-7886

Affiliations:
  • Institute of Mathematical Sciences, Chennai, India


According to our database1, Abhranil Chatterjee authored at least 20 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Characterizing and Testing Principal Minor Equivalence of Matrices.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Determinants vs. Algebraic Branching Programs.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Trading Determinism for Noncommutativity in Edmonds' Problem.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
On Lifting Lower Bounds for Noncommutative Circuits using Automata.
Electron. Colloquium Comput. Complex., 2023

The Noncommutative Edmonds' Problem Re-visited.
CoRR, 2023

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Border Complexity of Symbolic Determinant Under Rank One Restriction.
Proceedings of the 38th Computational Complexity Conference, 2023

2022
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time.
Proceedings of the Approximation, 2022

2021
Equivalence Testing of Weighted Automata over Partially Commutative Monoids.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.
CoRR, 2020

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Efficient Black-Box Identity Testing for Free Group Algebra.
Electron. Colloquium Comput. Complex., 2019

Efficient Black-Box Identity Testing over Free Group Algebra.
CoRR, 2019

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Fast Exact Algorithms Using Hadamard Product of Polynomials.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Efficient Black-Box Identity Testing for Free Group Algebras.
Proceedings of the Approximation, 2019

2018
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.
Electron. Colloquium Comput. Complex., 2018

A Note on Polynomial Identity Testing for Depth-3 Circuits.
CoRR, 2018

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018


  Loading...