Srikanth Srinivasan
Srikanth Srinivasan
Department of Mathematics, Indian Institute of Technology Bombay
Dirección de correo verificada de math.iitb.ac.in
Título
Citado por
Citado por
Año
Lower bounds for depth-4 formulas computing iterated matrix multiplication
H Fournier, N Limaye, G Malod, S Srinivasan
SIAM Journal on Computing 44 (5), 1173-1201, 2015
842015
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
742017
New results on noncommutative and commutative polynomial identity testing
V Arvind, P Mukhopadhyay, S Srinivasan
Computational Complexity 19 (4), 521-558, 2010
442010
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
432012
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
43*2010
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
342015
Average-case lower bounds and satisfiability algorithms for small threshold circuits
R Chen, R Santhanam, S Srinivasan
arXiv preprint arXiv:1806.06290, 2018
332018
Composition limits and separating examples for some Boolean function complexity measures
J Gilmer, M Saks, S Srinivasan
Combinatorica 36 (3), 265-311, 2016
312016
Certifying polynomials for AC^ 0 (parity) circuits, with applications
S Kopparty, S Srinivasan
IARCS Annual Conference on Foundations of Software Technology and …, 2012
302012
Certifying polynomials for AC^ 0 (parity) circuits, with applications
S Kopparty, S Srinivasan
IARCS Annual Conference on Foundations of Software Technology and …, 2012
302012
Arithmetic circuits and the hadamard product of polynomials
V Arvind, PS Joglekar, S Srinivasan
arXiv preprint arXiv:0907.4006, 2009
282009
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
V Guruswami, P Harsha, J Håstad, S Srinivasan, G Varma
SIAM Journal on Computing 46 (1), 132-159, 2017
272017
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
232014
On polynomial approximations to AC
P Harsha, S Srinivasan
Random Structures & Algorithms 54 (2), 289-303, 2019
222019
On the limits of sparsification
R Santhanam, S Srinivasan
International Colloquium on Automata, Languages, and Programming, 774-785, 2012
202012
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
192019
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
192016
Separation of AC Formulas and Circuits
B Rossman, S Srinivasan
arXiv preprint arXiv:1702.03625, 2017
162017
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
162011
Correlatio n Bou nds for Poly-size $\mbox {\rm AC}^ 0$ Circuits with n1− o (1) Symmetric Gates
S Lovett, S Srinivasan
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2011
162011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20