Rajit Datta

Publication Activity (10 Years)

Years Active: 2017-2022
Publications (10 Years): 25

Top Topics

Exact Algorithms

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ITCS (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)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Lower bounds for monotone arithmetic circuits via communication complexity. STOC (2021)
Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
Monotone Complexity of Spanning Tree Polynomial Re-visited. CoRR (2021)
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)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Negations Provide Strongly Exponential Savings. Electron. Colloquium Comput. Complex. 27 (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)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. Electron. Colloquium Comput. Complex. 27 (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)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. 24 (2017)