Follow
Srikanth Srinivasan
Srikanth Srinivasan
Department of Computer Science, University of Copenhagen
Verified email at di.ku.dk - Homepage
Title
Cited by
Cited by
Year
Lower bounds for depth 4 formulas computing iterated matrix multiplication
H Fournier, N Limaye, G Malod, S Srinivasan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
992014
An exponential lower bound for homogeneous depth four arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
SIAM Journal on Computing 46 (1), 307-335, 2017
912017
Superpolynomial lower bounds against low-depth algebraic circuits
N Limaye, S Srinivasan, S Tavenas
Communications of the ACM 67 (2), 101-108, 2024
632024
New results on noncommutative and commutative polynomial identity testing
V Arvind, P Mukhopadhyay, S Srinivasan
Computational Complexity 19 (4), 521-558, 2010
562010
Approximating AC^ 0 by small height decision trees and a deterministic algorithm for# AC^ 0SAT
P Beame, R Impagliazzo, S Srinivasan
2012 IEEE 27th Conference on Computational Complexity, 117-125, 2012
542012
A tail bound for read‐k families of functions
D Gavinsky, S Lovett, M Saks, S Srinivasan
Random Structures & Algorithms 47 (1), 99-108, 2015
502015
On the hardness of the noncommutative determinant
V Arvind, S Srinivasan
Proceedings of the forty-second ACM symposium on Theory of computing, 677-686, 2010
49*2010
Average-case lower bounds and satisfiability algorithms for small threshold circuits
R Chen, R Santhanam, S Srinivasan
arXiv preprint arXiv:1806.06290, 2018
482018
Composition limits and separating examples for some Boolean function complexity measures
J Gilmer, M Saks, S Srinivasan
Combinatorica 36 (3), 265-311, 2016
472016
On polynomial approximations to AC
P Harsha, S Srinivasan
Random Structures & Algorithms 54 (2), 289-303, 2019
342019
Arithmetic circuits and the hadamard product of polynomials
V Arvind, PS Joglekar, S Srinivasan
arXiv preprint arXiv:0907.4006, 2009
322009
Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications
S Chillara, N Limaye, S Srinivasan
SIAM Journal on Computing 48 (1), 70-92, 2019
292019
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
V Guruswami, P Harsha, J Håstad, S Srinivasan, G Varma
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
292014
Certifying polynomials for AC^ 0 (parity) circuits, with applications
S Kopparty, S Srinivasan
IARCS Annual Conference on Foundations of Software Technology and …, 2012
292012
A near-optimal depth-hierarchy theorem for small-depth multilinear circuits
S Chillara, C Engels, N Limaye, S Srinivasan
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018
252018
On the limits of sparsification
R Santhanam, S Srinivasan
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
252012
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas
N Kayal, N Limaye, C Saha, S Srinivasan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
242014
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
232016
Correlation Bounds for Poly-size Circuits with n 1− o (1) Symmetric Gates
S Lovett, S Srinivasan
International Workshop on Approximation Algorithms for Combinatorial …, 2011
232011
Streaming algorithms for recognizing nearly well-parenthesized expressions
A Krebs, N Limaye, S Srinivasan
International Symposium on Mathematical Foundations of Computer Science, 412-423, 2011
222011
The system can't perform the operation now. Try again later.
Articles 1–20