Karteek Sreenivasaiah

Available identifiers

Publication	Date of Publication	Type
Linear threshold functions in decision lists, decision trees, and depth-2 circuits	2023-10-12	Paper
https://portal.mardi4nfdi.de/entity/Q5090953	2022-07-21	Paper
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem	2021-09-10	Paper
On the complexity of hazard-free circuits	2020-02-11	Paper
A fixed-depth size-hierarchy theorem for AC ⁰ [⊕] via the coin problem	2020-01-30	Paper
Space-efficient approximations for subset sum	2019-12-06	Paper
Small Depth Proof Systems	2019-12-06	Paper
On the complexity of hazard-free circuits	2019-08-22	Paper
A game characterisation of tree-like Q-resolution size	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	2016-12-21	Paper
A game characterisation of tree-like Q-resolution size	2016-04-08	Paper
Building above read-once polynomials: identity testing and hardness of representation	2014-09-26	Paper
Monomials, multilinearity and identity testing in simple read-restricted circuits	2014-02-11	Paper
Small Depth Proof Systems	2013-09-20	Paper
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs	2012-09-25	Paper
The complexity of unary subset sum	2012-09-25	Paper

This page was built for person: Karteek Sreenivasaiah