◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mrinal Kumar

15 papers hereh-index 8186 citations23 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author5
  • middle author8
  • last author1

Across the 15 of 15 papers where every author was matched, so the position is known.

fields
  • cs.CC14
  • cs.DS1
same name
  • Mrinal Kumar — 3 papers, h 6
  • Mrinal Kumar — 2 papers
  • Mrinal Kumar — 2 papers, h 2
  • Mrinal Kumar — 2 papers
  • Mrinal Kumar — 1 paper, h 7
  • Mrinal Kumar — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152023
most citedAn exponential lower bound for homogeneous depth-5 circuits over finite fields

11 citations · 17 across the 4 of their papers we have counts for

collaborators
Showing 2018Show all

4 papers · 1 filter

cs.CC2018

Arithmetic Circuits with Locally Low Algebraic Rank

Mrinal Kumar, Shubhangi Saraf

In recent years, there has been a flurry of activity towards proving lower bounds for homogeneous depth-4 arithmetic circuits, which has brought us very close to statements that ar…

cs.CC2018

On Multilinear Forms: Bias, Correlation, and Tensor Rank

Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami +2

In this paper, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank of tensors over $G…

cs.CC2018

On top fan-in vs formal degree for depth-3 arithmetic circuits

Mrinal Kumar

We show that over the field of complex numbers, \emph{every} homogeneous polynomial of degree d can be approximated (in the border complexity sense) by a depth-3 arithmetic cir…

cs.CC2018

Some Closure Results for Polynomial Factorization and Applications

Chi-Ning Chou, Mrinal Kumar, Noam Solomon

In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if ot…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.