Rajit Datta

According to our database, Rajit Datta authored at least 16 papers between 2017 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Monotone Complexity of Spanning Tree Polynomial Re-Visited.

Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Lower bounds for monotone arithmetic circuits via communication complexity.

Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Equivalence Testing of Weighted Automata over Partially Commutative Monoids.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Negations Provide Strongly Exponential Savings.

Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay

Electron. Colloquium Comput. Complex., 2020

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

CoRR, 2020

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Efficient Black-Box Identity Testing for Free Group Algebra.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Electron. Colloquium Comput. Complex., 2019

Efficient Black-Box Identity Testing over Free Group Algebra.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

CoRR, 2019

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Fast Exact Algorithms Using Hadamard Product of Polynomials.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

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.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Proceedings of the Approximation, 2019

2018

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Electron. Colloquium Comput. Complex., 2018

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

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

CoRR, 2018

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.

Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.

Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S

Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.

Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017