Browse by IITH Authors
 | Up a level |
Limaye, N and Sreenivasaiah, K. et al. (2021) A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput., 50 (4). pp. 1461-1499. ISSN 1095-7111
Limaye, Nutan and Sreenivasaiah, Karteek and Srinivasan, Srikanth and et al, . (2021) A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM Journal on Computing, 50 (4). pp. 1461-1499. ISSN 0097-5397
Ikenmeyer, Christian and Komarath, Balagopal and Sreenivasaiah, Karteek and et al, . (2019) On the Complexity of Hazard-free Circuits. Journal of the ACM, 66 (4). pp. 1-20. ISSN 00045411
Limaye, Nutan and Sreenivasaiah, Karteek and Srinivasan, Srikanth et. al. (2019) A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 23 - 26 June 2019, Phoenix, AZ, USA.
Blaser, Markus and Komarath, Balagopal and Sreenivasaiah, Karteek (2018) Graph Pattern Polynomials. In: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 11-13 December 2018, Ahmedabad, India.
Engles, Christian and Rao, B V Raghavendra and Sreenivasaiah, Karteek (2017) On Σ A Σ A Σ Circuits: The Role of Middle Σ Fan-in, Homogeneity and Bottom Degree. In: International Symposium on Fundamentals of Computation Theory, 11-13 September 2017, Bordeaux, France.
