PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kumar, Mrinal"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for Matrix Factorization.

, and . Electronic Colloquium on Computational Complexity (ECCC), (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manish Kumar University of Stuttgart

Shreya Kumar University of Stuttgart

Tarun Kumar Mitruka Vinod Kumar Mitruka University of Stuttgart

Ratnesh Kumar Gupta University of Stuttgart

Bhupender Kumar Saini University of Stuttgart

 

Other publications of authors with the same name

Multi-resolution state-space discretization for Q-Learning with pseudo-randomized discretization., , and . IJCNN, page 1-8. IEEE, (2010)A MCMC/Bernstein approach to chance constrained programs., and . ACC, page 4318-4323. IEEE, (2014)Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices., , and . TOCT, 8 (3): 8:1-8:17 (2016)Approximation Algorithms for Minimum Chain Vertex Deletion., , , and . WALCOM, volume 6552 of Lecture Notes in Computer Science, page 21-32. Springer, (2011)Computational Approaches Toward Integrating Quantified Self Sensing and Social Media., , and . CSCW, page 1334-1349. ACM, (2017)Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing., and . Computational Complexity Conference, volume 50 of LIPIcs, page 35:1-35:29. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Functional Lower Bounds for Arithmetic Circuits and Connections to Boolean Circuit Complexity., , and . Computational Complexity Conference, volume 50 of LIPIcs, page 33:1-33:19. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2016)Faster Parameterized Algorithms for Deletion to Split Graphs., , , , , , and . Algorithmica, 71 (4): 989-1006 (2015)Hardness vs Randomness for Bounded Depth Arithmetic Circuits., , and . Computational Complexity Conference, volume 102 of LIPIcs, page 13:1-13:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Solution of high dimensional transient Fokker-Planck equations by tensor decomposition., and . ACC, page 1475-1480. IEEE, (2015)