( en | de | ru )

 

Disambiguation of "Srinivasan, Srikanth"

Author of the publication

copydeleteadd this publication to your clipboard
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas.

, , , and . SIAM J. Comput., 46 (1): 307-335 (2017)

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.

Srikanth Karnati

Functional characterization of peroxisomes and pathological consequences of peroxisomal dysfunction in the lung. Uni Gießen, (2009)

Srikanth Perike

Srikanth Jagabathula

R Srinivasan

Sadagopan Srinivasan

 

Other publications of authors with the same name

The Remote Point Problem, Small Bias Space, and Expanding Generator Sets, and . CoRR, (2009)Noise Immune, Low-Skew, Pulse Width Retainable Analog Glitch-Filter., , , and . ISCAS, page 1-4. IEEE, (2019)Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications., , and . SIAM J. Comput., 48 (1): 70-92 (2019)On the probabilistic degree of OR over the reals., , , and . Random Struct. Algorithms, 59 (1): 53-67 (2021)Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits., , and . CCC, volume 50 of LIPIcs, page 1:1-1:35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A robust version of Hegedus's lemma, with applications.. STOC, page 1349-1362. ACM, (2020)Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications., , and . STACS, volume 96 of LIPIcs, page 21:1-21:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds., , and . MFCS, volume 117 of LIPIcs, page 78:1-78:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)On Improved Degree Lower Bounds for Polynomial Approximation.. FSTTCS, volume 24 of LIPIcs, page 201-212. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes., , , and . CCC, volume 234 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)