Karteek Sreenivasaiah

According to our database, Karteek Sreenivasaiah authored at least 19 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Linear threshold functions in decision lists, decision trees, and depth-2 circuits.

Yogesh Dahiya, K. Vignesh, Meena Mahajan, Karteek Sreenivasaiah

Inf. Process. Lett., January, 2024

2023

Depth-3 Circuit Lower Bounds for k-OV.

Tameem Choudhury, Karteek Sreenivasaiah

Electron. Colloquium Comput. Complex., 2023

2021

A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

SIAM J. Comput., 2021

2019

A game characterisation of tree-like Q-Resolution size.

Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah

J. Comput. Syst. Sci., 2019

On the Complexity of Hazard-free Circuits.

Christian Ikenmeyer, Balagopal Komarath, Christoph Lenzen, Vladimir Lysikov, Andrey Mokhov, Karteek Sreenivasaiah

J. ACM, 2019

A fixed-depth size-hierarchy theorem for AC⁰[⊕] via the coin problem.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

The Coin Problem in Constant Depth: Sample Complexity and Parity gates.

Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

Electron. Colloquium Comput. Complex., 2018

Graph Pattern Polynomials.

Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.

Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.

Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Electron. Colloquium Comput. Complex., 2016

Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Algorithmica, 2016

2014

Monomials, multilinearity and identity testing in simple read-restricted circuits.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Theor. Comput. Sci., 2014

Space-Efficient Approximations for Subset Sum.

Anna Gál, Jing-Tang Jang, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah

Electron. Colloquium Comput. Complex., 2014

2013

Small Depth Proof Systems.

Andreas Krebs, Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah

Electron. Colloquium Comput. Complex., 2013

2012

Verifying Proofs in Constant Depth.

Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2012

Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs.

Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

The Complexity of Unary Subset Sum.

Nutan Limaye, Meena Mahajan, Karteek Sreenivasaiah

Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Counting paths in planar width 2 branching programs.

Meena Mahajan, Nitin Saurabh, Karteek Sreenivasaiah

Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011

Verifying Proofs in Constant Depth.

Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011