Rajit Datta

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
Theory Comput. Syst., 2022

Fast Exact Algorithms Using Hadamard Product of Polynomials.
Algorithmica, 2022

Monotone Complexity of Spanning Tree Polynomial Re-Visited.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 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
Negations Provide Strongly Exponential Savings.
Electron. Colloquium Comput. Complex., 2020

Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity.
Electron. Colloquium Comput. Complex., 2020

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

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
Chic. J. Theor. Comput. Sci., 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

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

2017
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017


  Loading...