Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; S. Raja 001 (MFCS, 2017)

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. - Vikraman Arvind; Rajit Datta; Partha Mukhopadhyay; Raja S 001 (Electron. Colloquium Comput. Complex., 2017)

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)

Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. - Arkadev Chattopadhyay; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2020)

Negations Provide Strongly Exponential Savings. - Arkadev Chattopadhyay; Rajit Datta; Partha Mukhopadhyay (Electron. Colloquium Comput. Complex., 2020)

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

Monotone Complexity of Spanning Tree Polynomial Re-Visited. - Arkadev Chattopadhyay; Rajit Datta; Utsab Ghosal; Partha Mukhopadhyay (ITCS, 2022)

Fast Exact Algorithms Using Hadamard Product of Polynomials. - Vikraman Arvind; Abhranil Chatterjee 001; Rajit Datta; Partha Mukhopadhyay (Algorithmica, 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)