default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSrikanth Srinivasan 0001
Person information
- affiliation: Aarhus University, Denmark
- affiliation: IIT Bombay, Department of Mathematics, India
Other persons with the same name
- Srikanth Srinivasan 0002 — University of South Florida, Tampa, FL, USA
- Srikanth Srinivasan 0003 — Texas Instruments, Bangalore, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Commun. ACM 67(2): 101-108 (2024)- [c52]Hervé Fournier, Nutan Limaye
, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. STOC 2024: 141-151 - [c51]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. STOC 2024: 764-775 - [i81]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. CoRR abs/2403.20305 (2024) - [i80]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Low Degree Local Correction Over the Boolean Cube. CoRR abs/2411.07374 (2024) - [i79]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - [i78]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Low Degree Local Correction Over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j29]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Comput. Complex. 32(1): 3 (2023) - [j28]Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. TheoretiCS 2 (2023) - [c50]Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan:
Low-Degree Testing over Grids. APPROX/RANDOM 2023: 41:1-41:22 - [c49]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CCC 2023: 28:1-28:19 - [c48]Srikanth Srinivasan, Utkarsh Tripathi:
Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC 2023: 881-894 - [e1]Patricia Bouyer, Srikanth Srinivasan:
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India. LIPIcs 284, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-304-1 [contents] - [i77]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. CoRR abs/2302.06984 (2023) - [i76]Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan:
Low-Degree Testing Over Grids. CoRR abs/2305.04983 (2023) - [i75]Srikanth Srinivasan, Amir Yehudayoff:
The discrepancy of greater-than. CoRR abs/2309.08703 (2023) - [i74]Hervé Fournier, Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Power of Homogeneous Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i73]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan, Sébastien Tavenas:
Towards Optimal Depth-Reductions for Algebraic Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j27]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Algorithmica 84(4): 1132-1162 (2022) - [j26]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits. SIGACT News 53(2): 40-62 (2022) - [c47]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC 2022: 31:1-31:14 - [c46]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. CCC 2022: 32:1-32:23 - [c45]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-Hardness of Some Monomial Symmetric Polynomials. FSTTCS 2022: 16:1-16:14 - [c44]Sébastien Tavenas, Nutan Limaye, Srikanth Srinivasan:
Set-multilinear and non-commutative formula lower bounds for iterated matrix multiplication. STOC 2022: 416-425 - [i72]Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. CoRR abs/2202.04982 (2022) - [i71]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR abs/2205.10749 (2022) - [i70]Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan:
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i69]Radu Curticapean, Nutan Limaye, Srikanth Srinivasan:
On the VNP-hardness of Some Monomial Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - [i68]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j25]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59(1): 53-67 (2021) - [j24]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. 50(4): 1461-1499 (2021) - [j23]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean Functions. SIAM J. Discret. Math. 35(3): 2070-2092 (2021) - [c43]Srikanth Srinivasan, S. Venkitesh:
On the Probabilistic Degree of an n-Variate Boolean Function. APPROX-RANDOM 2021: 42:1-42:20 - [c42]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. FOCS 2021: 804-814 - [i67]Srikanth Srinivasan, S. Venkitesh:
On the Probabilistic Degree of an n-variate Boolean Function. CoRR abs/2107.03171 (2021) - [i66]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Electron. Colloquium Comput. Complex. TR21 (2021) - [i65]Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Electron. Colloquium Comput. Complex. TR21 (2021) - [i64]Srikanth Srinivasan, S. Venkitesh:
On the Probabilistic Degree of an $n$-variate Boolean Function. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j22]Mitali Bafna, Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Random Struct. Algorithms 57(3): 658-694 (2020) - [j21]Srikanth Srinivasan:
Strongly Exponential Separation between Monotone VP and Monotone VNP. ACM Trans. Comput. Theory 12(4): 23:1-23:12 (2020) - [j20]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Variants of Reed-Muller Codes over Finite Grids. ACM Trans. Comput. Theory 12(4): 25:1-25:11 (2020) - [c41]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. CCC 2020: 14:1-14:27 - [c40]Srikanth Srinivasan:
A robust version of Hegedus's lemma, with applications. STOC 2020: 1349-1362 - [i63]Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j19]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Comput. Complex. 28(3): 471-542 (2019) - [j18]Prahladh Harsha, Srikanth Srinivasan:
On polynomial approximations to AC. Random Struct. Algorithms 54(2): 289-303 (2019) - [j17]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications. SIAM J. Comput. 48(1): 70-92 (2019) - [j16]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory 65(1): 184-197 (2019) - [j15]Srikanth Srinivasan:
Special Issue: CCC 2018: Guest Editor's Foreword. Theory Comput. 15: 1-3 (2019) - [j14]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC0[⊕] Formulas and Circuits. Theory Comput. 15: 1-20 (2019) - [c39]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity Helps to Compute Majority. CCC 2019: 23:1-23:17 - [c38]Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on AC^0[oplus] and Variants of the Majority Function. FSTTCS 2019: 22:1-22:14 - [c37]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean Functions. FSTTCS 2019: 28:1-28:14 - [c36]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. ITCS 2019: 8:1-8:20 - [c35]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. STOC 2019: 442-453 - [i62]Srikanth Srinivasan:
Strongly Exponential Separation Between Monotone VP and Monotone VNP. CoRR abs/1903.01630 (2019) - [i61]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Downset codes over a finite grid. CoRR abs/1908.07215 (2019) - [i60]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean functions. CoRR abs/1910.02465 (2019) - [i59]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! CoRR abs/1911.12520 (2019) - [i58]Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! Electron. Colloquium Comput. Complex. TR19 (2019) - [i57]Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on $AC^0[\oplus]$ and Variants of the Majority Function. Electron. Colloquium Comput. Complex. TR19 (2019) - [i56]Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity helps to compute Majority. Electron. Colloquium Comput. Complex. TR19 (2019) - [i55]Srikanth Srinivasan:
Strongly Exponential Separation Between Monotone VP and Monotone VNP. Electron. Colloquium Comput. Complex. TR19 (2019) - [i54]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Downset codes over a finite grid. Electron. Colloquium Comput. Complex. TR19 (2019) - [i53]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean functions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j13]Vikraman Arvind, Srikanth Srinivasan:
On the hardness of the noncommutative determinant. Comput. Complex. 27(1): 1-29 (2018) - [j12]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Theory Comput. 14(1): 1-55 (2018) - [j11]Swastik Kopparty, Srikanth Srinivasan:
Certifying Polynomials for $\mathrm{AC}^0[\oplus]$ Circuits, with Applications to Lower Bounds and Circuit Compression. Theory Comput. 14(1): 1-24 (2018) - [c34]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS 2018: 934-945 - [c33]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. FSTTCS 2018: 5:1-5:12 - [c32]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. ICALP 2018: 36:1-36:13 - [c31]Srikanth Srinivasan, Madhu Sudan:
Local Decoding and Testing of Polynomials over Grids. ITCS 2018: 26:1-26:14 - [c30]Ninad Rajgopal, Rahul Santhanam, Srikanth Srinivasan:
Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds. MFCS 2018: 78:1-78:15 - [c29]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. STACS 2018: 21:1-21:15 - [i52]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR abs/1804.02520 (2018) - [i51]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CoRR abs/1806.06290 (2018) - [i50]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR abs/1809.04092 (2018) - [i49]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. CoRR abs/1809.05932 (2018) - [i48]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. CoRR abs/1812.01982 (2018) - [i47]Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan:
A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates. Electron. Colloquium Comput. Complex. TR18 (2018) - [i46]Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. TR18 (2018) - [i45]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - [i44]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j10]Srikanth Srinivasan:
On Some Recent Projection Switching Lemmas for Small Depth Circuits. Bull. EATCS 122 (2017) - [j9]Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma:
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46(1): 132-159 (2017) - [j8]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. SIAM J. Comput. 46(1): 307-335 (2017) - [j7]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. Theory Comput. 13(1): 1-34 (2017) - [c28]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC^0[oplus] Formulas and Circuits. ICALP 2017: 50:1-50:13 - [c27]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-Commutative Arithmetic Circuits with Restricted Parse Trees. MFCS 2017: 41:1-41:14 - [c26]Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On Polynomial Approximations Over Z/2^kZ*. STACS 2017: 12:1-12:12 - [i43]Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On polynomial approximations over Z/2kZ. CoRR abs/1701.06268 (2017) - [i42]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC$^0[\oplus]$ Formulas and Circuits. CoRR abs/1702.03625 (2017) - [i41]Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. CoRR abs/1709.06036 (2017) - [i40]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. CoRR abs/1710.05481 (2017) - [i39]Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On polynomial approximations over ℤ/2kℤ. Electron. Colloquium Comput. Complex. TR17 (2017) - [i38]Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan:
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i37]Guillaume Lagarde, Nutan Limaye, Srikanth Srinivasan:
Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. TR17 (2017) - [i36]Benjamin Rossman, Srikanth Srinivasan:
Separation of AC0[⊕] Formulas and Circuits. Electron. Colloquium Comput. Complex. TR17 (2017) - [i35]Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j6]Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition limits and separating examples for some boolean function complexity measures. Comb. 36(3): 265-311 (2016) - [j5]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Non-Commutative Skew Circuits. Theory Comput. 12(1): 1-38 (2016) - [c25]Prahladh Harsha, Srikanth Srinivasan:
On Polynomial Approximations to AC^0. APPROX-RANDOM 2016: 32:1-32:14 - [c24]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. CCC 2016: 1:1-1:35 - [c23]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS 2016: 17:1-17:14 - [i34]Prahladh Harsha, Srikanth Srinivasan:
On Polynomial Approximations to ${AC}^0$. CoRR abs/1604.08121 (2016) - [i33]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-based Tests for Reed-Muller Codes. CoRR abs/1612.03086 (2016) - [i32]Nikhil Balaji, Nutan Limaye, Srikanth Srinivasan:
An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. Electron. Colloquium Comput. Complex. TR16 (2016) - [i31]Prahladh Harsha, Srikanth Srinivasan:
Robust Multiplication-based Tests for Reed-Muller Codes. Electron. Colloquium Comput. Complex. TR16 (2016) - [i30]Srikanth Srinivasan:
On Polynomial Approximations to AC0. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j4]Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A tail bound for read-k families of functions. Random Struct. Algorithms 47(1): 99-108 (2015) - [j3]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication. SIAM J. Comput. 44(5): 1173-1201 (2015) - [c22]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials. MFCS (2) 2015: 324-335 - [c21]Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma:
Derandomized Graph Product Results Using the Low Degree Long Code. STACS 2015: 275-287 - [i29]Ruiwen Chen, Rahul Santhanam, Srikanth Srinivasan:
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - [i28]Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan:
The shifted partial derivative complexity of Elementary Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for non-commutative skew circuits. Electron. Colloquium Comput. Complex. TR15 (2015) - [i26]Srikanth Srinivasan:
A Compression Algorithm for AC0[⊕] circuits using Certifying Polynomials. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c20]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. FOCS 2014: 61-70 - [c19]Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan:
Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. STOC 2014: 119-127 - [c18]Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan:
Lower bounds for depth 4 formulas computing iterated matrix multiplication. STOC 2014: 128-135 - [c17]