A Note on Polynomial Identity Testing for Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2018)

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2018)

Efficient Black-Box Identity Testing for Free Group Algebras. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (APPROX-RANDOM, 2019)

Efficient Black-Box Identity Testing over Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2019)

Efficient Black-Box Identity Testing for Free Group Algebra. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2019)

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2020)

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Chic. J. Theor. Comput. Sci., 2020)

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (CoRR, 2020)

Equivalence Testing of Weighted Automata over Partially Commutative Monoids. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (MFCS, 2021)

Fast Exact Algorithms Using Hadamard Product of Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Algorithmica, 2022)

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2022)

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Theory Comput. Syst., 2022)

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. - Vikraman Arvind; Abhranil Chatterjee 001; Utsab Ghosal; Partha Mukhopadhyay; C. Ramya (ITCS, 2023)

The Noncommutative Edmonds' Problem Re-visited. - Abhranil Chatterjee 001; Partha Mukhopadhyay (CoRR, 2023)

Border Complexity of Symbolic Determinant under Rank One Restriction. - Abhranil Chatterjee 001; Sumanta Ghosh; Rohit Gurjar; Roshan Raj (Electron. Colloquium Comput. Complex., 2023)

On Lifting Lower Bounds for Noncommutative Circuits using Automata. - Vikraman Arvind; Abhranil Chatterjee 001 (Electron. Colloquium Comput. Complex., 2023)

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2023)

Characterizing and Testing Principal Minor Equivalence of Matrices. - Abhranil Chatterjee 001; Sumanta Ghosh; Rohit Gurjar; Roshan Raj (Electron. Colloquium Comput. Complex., 2024)

Trading Determinism for Noncommutativity in Edmonds' Problem. - Vikraman Arvind; Abhranil Chatterjee 001; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2024)

Determinants vs. Algebraic Branching Programs. - Abhranil Chatterjee 001; Mrinal Kumar 001; Ben Lee Volk (Comput. Complex., 2024)