Karteek Sreenivasaiah

37 papers A* 2A 1B 5C 1Misc 2Journal 24Unranked 2
YearRankTypeTitle / Venue / Authors
2025 B conf
Sensitivity and Query Complexity Under Uncertainty.
MFCS
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2025 J jnl
Sensitivity and Query Complexity under Uncertainty.
CoRR
Deepu Benson, Balagopal Komarath, Nikhil S. Mande, Nalli Sai Soumya, Jayalal Sarma, Karteek Sreenivasaiah
2024 A conf
Depth-3 Circuit Lower Bounds for k-OV.
STACS
Tameem Choudhury, Karteek Sreenivasaiah
2024 J jnl
Linear threshold functions in decision lists, decision trees, and depth-2 circuits.
Inf. Process. Lett.
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
2024 J jnl
Query Complexity with Unknowns.
CoRR
Nikhil S. Mande, Karteek Sreenivasaiah
2023 J jnl
Depth-3 Circuit Lower Bounds for k-OV.
Electron. Colloquium Comput. Complex.
Tameem Choudhury, Karteek Sreenivasaiah
2023 J jnl
Linear threshold functions in decision lists, decision trees, and depth-2 circuits.
Electron. Colloquium Comput. Complex.
Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah
2021 J jnl
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.
SIAM J. Comput.
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019 A* conf
A fixed-depth size-hierarchy theorem for AC
STOC
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2019 J jnl
A game characterisation of tree-like Q-Resolution size.
J. Comput. Syst. Sci.
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2019 J jnl
On the Complexity of Hazard-free Circuits.
J. ACM
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018 — conf
Graph Pattern Polynomials.
FSTTCS
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
2018 J jnl
Graph Pattern Polynomials.
CoRR
Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah
2018 A* conf
On the complexity of hazard-free circuits.
STOC
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2018 J jnl
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates.
CoRR
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2018 J jnl
The Coin Problem in Constant Depth: Sample Complexity and Parity gates.
Electron. Colloquium Comput. Complex.
Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh
2017 B conf
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.
FCT
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2017 J jnl
On the complexity of hazard-free circuits.
CoRR
Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah
2016 J jnl
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.
Algorithmica
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2016 J jnl
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.
Electron. Colloquium Comput. Complex.
Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2016 J jnl
Small Depth Proof Systems.
ACM Trans. Comput. Theory
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2016 J jnl
Space-Efficient Approximations for Subset Sum.
ACM Trans. Comput. Theory
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2015 C conf
A Game Characterisation of Tree-like Q-resolution Size.
LATA
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2015 J jnl
Building above read-once polynomials: identity testing and hardness of representation.
Electron. Colloquium Comput. Complex.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2014 J jnl
A game characterisation of tree-like Q-Resolution size.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah
2014 Misc conf
Building above Read-once Polynomials: Identity Testing and Hardness of Representation.
COCOON
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2014 J jnl
Monomials, multilinearity and identity testing in simple read-restricted circuits.
Theor. Comput. Sci.
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2014 J jnl
Space-Efficient Approximations for Subset Sum.
Electron. Colloquium Comput. Complex.
Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 B conf
Small Depth Proof Systems.
MFCS
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Small Depth Proof Systems.
CoRR
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Small Depth Proof Systems.
Electron. Colloquium Comput. Complex.
Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2013 J jnl
Verifying proofs in constant depth.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2012 — conf
Counting paths in planar width 2 branching programs.
CATS
Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah
2012 B conf
Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.
MFCS
Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah
2012 Misc conf
The Complexity of Unary Subset Sum.
COCOON
Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah
2012 J jnl
Verifying Proofs in Constant Depth.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2011 B conf
Verifying Proofs in Constant Depth.
MFCS
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer