Karteek Sreenivasaiah

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 21

Top Topics

Sample Complexity

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

Publications

Tameem Choudhury, Karteek Sreenivasaiah
Depth-3 Circuit Lower Bounds for k-OV. STACS (2024)
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Inf. Process. Lett. 183 (2024)
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
Linear threshold functions in decision lists, decision trees, and depth-2 circuits. Electron. Colloquium Comput. Complex. (2023)
Tameem Choudhury, Karteek Sreenivasaiah
Depth-3 Circuit Lower Bounds for k-OV. Electron. Colloquium Comput. Complex. (2023)
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) (2021)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
[⊕] via the coin problem. STOC (2019)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the Complexity of Hazard-free Circuits. J. ACM 66 (4) (2019)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A game characterisation of tree-like Q-Resolution size. J. Comput. Syst. Sci. 104 (2019)
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
Graph Pattern Polynomials. FSTTCS (2018)
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR (2018)
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. 25 (2018)
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
Graph Pattern Polynomials. CoRR (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. STOC (2018)
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
On the complexity of hazard-free circuits. CoRR (2017)
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. FCT (2017)
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation. Algorithmica 76 (4) (2016)
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Space-Efficient Approximations for Subset Sum. ACM Trans. Comput. Theory 8 (4) (2016)
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Small Depth Proof Systems. ACM Trans. Comput. Theory 9 (1) (2016)
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electron. Colloquium Comput. Complex. 23 (2016)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A Game Characterisation of Tree-like Q-resolution Size. LATA (2015)
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Building above read-once polynomials: identity testing and hardness of representation. Electron. Colloquium Comput. Complex. 22 (2015)
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Monomials, multilinearity and identity testing in simple read-restricted circuits. Theor. Comput. Sci. 524 (2014)
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Space-Efficient Approximations for Subset Sum. Electron. Colloquium Comput. Complex. 21 (2014)
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
A game characterisation of tree-like Q-Resolution size. Electron. Colloquium Comput. Complex. 21 (2014)
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. COCOON (2014)
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Small Depth Proof Systems. Electron. Colloquium Comput. Complex. 20 (2013)
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Small Depth Proof Systems. CoRR (2013)
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
Small Depth Proof Systems. MFCS (2013)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5 (1) (2013)
Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
The Complexity of Unary Subset Sum. COCOON (2012)
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs. MFCS (2012)
Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah
Counting paths in planar width 2 branching programs. CATS (2012)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. 19 (2012)
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. MFCS (2011)