Karteek Sreenivasaiah

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Linear threshold functions in decision lists, decision trees, and depth-2 circuits Information Processing Letters	2023-10-12	Paper
scientific article; zbMATH DE number 7561323 (Why is no real title available?)	2022-07-21	Paper
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] SIAM Journal on Computing	2021-09-10	Paper
On the complexity of hazard-free circuits Journal of the ACM	2020-02-11	Paper
A fixed-depth size-hierarchy theorem for AC ⁰ [⊕ via the coin problem] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing	2020-01-30	Paper
Space-efficient approximations for subset sum ACM Transactions on Computation Theory	2019-12-06	Paper
Small depth proof systems ACM Transactions on Computation Theory	2019-12-06	Paper
On the complexity of hazard-free circuits Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
A game characterisation of tree-like Q-resolution size Journal of Computer and System Sciences	2019-06-25	Paper
On $\varSigma\wedge\varSigma\wedge\varSigma$ circuits: the role of middle $\varSigma$ fan-in, homogeneity and bottom degree	2017-11-22	Paper
Building above read-once polynomials: identity testing and hardness of representation Algorithmica	2016-12-21	Paper
A game characterisation of tree-like Q-resolution size Language and Automata Theory and Applications	2016-04-08	Paper
Building above read-once polynomials: identity testing and hardness of representation Lecture Notes in Computer Science	2014-09-26	Paper
Monomials, multilinearity and identity testing in simple read-restricted circuits Theoretical Computer Science	2014-02-11	Paper
Small depth proof systems Lecture Notes in Computer Science	2013-09-20	Paper
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs Mathematical Foundations of Computer Science 2012	2012-09-25	Paper
The complexity of unary subset sum Lecture Notes in Computer Science	2012-09-25	Paper

Research outcomes over time

This page was built for person: Karteek Sreenivasaiah