Kamu erişimi zorunlu olan makaleler - Srikanth SrinivasanDaha fazla bilgi edinin
Hiçbir yerde sunulmuyor: 1
Decoding variants of Reed-Muller codes over finite grids
S Srinivasan, U Tripathi, S Venkitesh
ACM Transactions on Computation Theory (TOCT) 12 (4), 1-11, 2020
Zorunlu olanlar: Council of Scientific and Industrial Research, India, Department of Science …
Bir yerde sunuluyor: 24
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
Zorunlu olanlar: Department of Science & Technology, India
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
Zorunlu olanlar: Department of Science & Technology, India
Superpolynomial lower bounds against low-depth algebraic circuits
N Limaye, S Srinivasan, S Tavenas
Communications of the ACM 67 (2), 101-108, 2024
Zorunlu olanlar: Department of Science & Technology, India
Composition limits and separating examples for some Boolean function complexity measures
J Gilmer, M Saks, S Srinivasan
Combinatorica 36 (3), 265-311, 2016
Zorunlu olanlar: US National Science Foundation
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
Zorunlu olanlar: European Commission
Lower bounds for non-commutative skew circuits
N Limaye, G Malod, S Srinivasan
Theory of Computing 12 (1), 1-38, 2016
Zorunlu olanlar: Department of Science & Technology, India
On improved degree lower bounds for polynomial approximation
S Srinivasan
IARCS Annual Conference on Foundations of Software Technology and …, 2013
Zorunlu olanlar: Department of Science & Technology, India
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem
N Limaye, K Sreenivasaiah, S Srinivasan, U Tripathi, S Venkitesh
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Zorunlu olanlar: Council of Scientific and Industrial Research, India, Department of Science …
Parity helps to compute majority
IC Oliveira, R Santhanam, S Srinivasan
Proceedings of the 34th Computational Complexity Conference (CCC) 137, 23, 2019
Zorunlu olanlar: European Commission
Strongly exponential separation between monotone VP and monotone VNP
S Srinivasan
ACM Transactions on Computation Theory (TOCT) 12 (4), 1-12, 2020
Zorunlu olanlar: Department of Science & Technology, India
Certifying Polynomials for Circuits, with Applications to Lower Bounds and Circuit Compression
S Kopparty, S Srinivasan
Theory of Computing 14 (1), 1-24, 2018
Zorunlu olanlar: US National Science Foundation, Department of Science & Technology, India
A# sat algorithm for small constant-depth circuits with PTF gates
S Bajpai, V Krishan, D Kush, N Limaye, S Srinivasan
Algorithmica 84 (4), 1132-1162, 2022
Zorunlu olanlar: Department of Science & Technology, India
Local decoding and testing of polynomials over grids
M Bafna, S Srinivasan, M Sudan
Random Structures & Algorithms 57 (3), 658-694, 2020
Zorunlu olanlar: US National Science Foundation
Schur polynomials do not have small formulas if the determinant does not
P Chaugule, M Kumar, N Limaye, CK Mohapatra, A She, S Srinivasan
computational complexity 32 (1), 3, 2023
Zorunlu olanlar: Natural Sciences and Engineering Research Council of Canada, Department of …
The shifted partial derivative complexity of elementary symmetric polynomials
H Fournier, N Limaye, M Mahajan, S Srinivasan
International Symposium on Mathematical Foundations of Computer Science, 324-335, 2015
Zorunlu olanlar: Department of Science & Technology, India
Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds
N Rajgopal, R Santhanam, S Srinivasan
43rd International Symposium on Mathematical Foundations of Computer Science, 2018
Zorunlu olanlar: European Commission
A robust version of hegedus’s lemma, with applications
S Srinivasan
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
Zorunlu olanlar: Department of Science & Technology, India
On the VNP-hardness of some monomial symmetric polynomials
R Curticapean, N Limaye, S Srinivasan
42nd IARCS Annual Conference on Foundations of Software Technology and …, 2022
Zorunlu olanlar: Villum Foundation
On the Probabilistic Degree of OR over the Reals
S Bhandari, P Harsha, T Molli, S Srinivasan
Random Structures & Algorithms 59 (1), 53-67, 2021
Zorunlu olanlar: Department of Science & Technology, India
Yayıncılık ve maddi kaynak bilgileri otomatik olarak bir bilgisayar programı tarafından belirlenmektedir