| Monotone Complexity of Spanning Tree Polynomial Re-Visited. | 0 | 0.34 | 2022 |
| Lower bounds for monotone arithmetic circuits via communication complexity | 0 | 0.34 | 2021 |
| Equivalence Testing of Weighted Automata over Partially Commutative Monoids. | 0 | 0.34 | 2021 |
| A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. | 0 | 0.34 | 2020 |
| Efficient Black-Box Identity Testing over Free Group Algebra | 0 | 0.34 | 2019 |
| On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. | 0 | 0.34 | 2019 |
| Acceptance of Bengal Fasal Bima Yojona by the Farmers: A Study of Purba Burdwan District of West Bengal, India | 0 | 0.34 | 2019 |
| Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. | 0 | 0.34 | 2018 |
| Fast Exact Algorithms Using Hadamard Product of Polynomials. | 1 | 0.37 | 2018 |
| A Note on Polynomial Identity Testing for Depth-3 Circuits. | 0 | 0.34 | 2018 |
| Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. | 0 | 0.34 | 2018 |
| Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. | 0 | 0.34 | 2017 |
| Randomized Polynomial Time Identity Testing for Noncommutative Circuits. | 0 | 0.34 | 2016 |
| Identity Testing for +-Regular Noncommutative Arithmetic Circuits. | 0 | 0.34 | 2016 |
| Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. | 4 | 0.46 | 2014 |
| On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. | 0 | 0.34 | 2014 |
| Determinantal Complexity of Iterated Matrix Multiplication Polynomial. | 1 | 0.36 | 2013 |
| MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data. | 3 | 0.41 | 2013 |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in | 17 | 0.63 | 2013 |
| Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields | 3 | 0.41 | 2013 |
| Near-Optimal expanding generator sets for solvable permutation groups | 0 | 0.34 | 2012 |
| Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs | 2 | 0.51 | 2011 |
| EXPANDING GENERATING SETS FOR SOLVABLE PERMUTATION GROUPS | 0 | 0.34 | 2011 |
| New Results on Noncommutative and Commutative Polynomial Identity Testing | 17 | 0.66 | 2010 |
| Isomorphism and canonization of tournaments and hypertournaments | 4 | 0.48 | 2010 |
| Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size | 19 | 0.74 | 2008 |
| Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size | 0 | 0.34 | 2008 |
| Quantum Query Complexity of Multilinear Identity Testing | 1 | 0.36 | 2008 |
| The ideal membership problem and polynomial identity testing | 0 | 0.34 | 2007 |
| The monomial ideal membership problem and polynomial identity testing | 17 | 0.78 | 2007 |
| The complexity of black-box ring problems | 2 | 0.45 | 2006 |
