Mrinal Kumar 0001 - Citegraph

Author Info

Name	Affiliation	Papers
MRINAL KUMAR 0001	Rutgers State Univ, Dept Comp Sci, Piscataway, NJ 08854 USA	26
Collaborators	Citations	PageRank
21	64	9.94
Referers	Referees	References
48	107	152

Search Limit

100107

Publications (26 rows)

Collaborators (21 rows)

Referers (48 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Lower Bounds For Matrix Factorization	0	0.34	2021
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits.	0	0.34	2019
Derandomization from Algebraic Hardness: Treading the Borders	0	0.34	2019
The Computational Power of Depth Five Arithmetic Circuits.	0	0.34	2019
Closure of VP under taking factors: a short and simple proof.	0	0.34	2019
Closure Results for Polynomial Factorization	1	0.37	2019
Lower Bounds for Matrix Factorization.	0	0.34	2019
A Quadratic Lower Bound for Algebraic Branching Programs.	0	0.34	2019
Some Closure Results for Polynomial Factorization and Applications.	0	0.34	2018
On top fan-in vs formal degree for depth-3 arithmetic circuits.	0	0.34	2018
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits.	0	0.34	2018
On Multilinear Forms: Bias, Correlation, and Tensor Rank.	0	0.34	2018
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits.	0	0.34	2018
Hardness vs Randomness for Bounded Depth Arithmetic Circuits.	0	0.34	2018
Towards an algebraic natural proofs barrier via polynomial identity testing.	2	0.36	2017
An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits.	0	0.34	2017
A quadratic lower bound for homogeneous algebraic branching programs.	1	0.35	2017
Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices.	1	0.35	2016
Arithmetic circuits with locally low algebraic rank.	3	0.37	2016
Finer separations between shallow arithmetic circuits.	1	0.35	2016
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity.	3	0.37	2016
An exponential lower bound for homogeneous depth-5 circuits over finite fields	6	0.42	2015
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields.	0	0.34	2015
On the Power of Homogeneous Depth 4 Arithmetic Circuits	21	0.70	2014
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.	10	0.55	2014
The limits of depth reduction for arithmetic formulas: it's all about the top fan-in	15	0.67	2013