Abhranil Chatterjee

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 35

Top Topics

Exact Algorithms

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. (2024)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. ITCS (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR (2024)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS (2023)
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
Border Complexity of Symbolic Determinant under Rank One Restriction. Electron. Colloquium Comput. Complex. (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee
On Lifting Lower Bounds for Noncommutative Circuits using Automata. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
Border Complexity of Symbolic Determinant Under Rank One Restriction. CCC (2023)
V. Arvind, Abhranil Chatterjee
On Lifting Lower Bounds for Noncommutative Circuits using Automata. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Mrinal Kumar, Ben Lee Volk
Determinants vs. Algebraic Branching Programs. CoRR (2023)
Abhranil Chatterjee, Partha Mukhopadhyay
The Noncommutative Edmonds' Problem Re-visited. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. APPROX/RANDOM (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. Electron. Colloquium Comput. Complex. (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66 (1) (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84 (2) (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR (2022)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS (2021)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chic. J. Theor. Comput. Sci. 2020 (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebra. Electron. Colloquium Comput. Complex. 26 (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Note on Polynomial Identity Testing for Depth-3 Circuits. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. FSTTCS (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. CoRR (2018)