( en | de | ru )

 

Disambiguation of "Venkitesh, S."

Author of the publication

copydeleteadd this publication to your clipboard
A fixed-depth size-hierarchy theorem for AC0⊕ via the coin problem.

, , , , and . STOC, page 442-453. ACM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

S Danischewski

S Hüttelmaier

S Leopold

S Steinlechner

S Bachmann

 

Other publications of authors with the same name

The Coin Problem in Constant Depth: Sample Complexity and Parity gates., , , , and . Electron. Colloquium Comput. Complex., (2018)Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes.. Electron. J. Comb., (2022)A Fixed-Depth Size-Hierarchy Theorem for $AC^0øplus$ via the Coin Problem., , , , and . SIAM J. Comput., 50 (4): 1461-1499 (2021)A fixed-depth size-hierarchy theorem for AC0⊕ via the coin problem., , , , and . STOC, page 442-453. ACM, (2019)On the Probabilistic Degrees of Symmetric Boolean Functions., , and . SIAM J. Discret. Math., 35 (3): 2070-2092 (2021)Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size., , and . CoRR, (2024)On the Probabilistic Degree of an n-Variate Boolean Function., and . APPROX-RANDOM, volume 207 of LIPIcs, page 42:1-42:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Decoding Variants of Reed-Muller Codes over Finite Grids., , and . ACM Trans. Comput. Theory, 12 (4): 25:1-25:11 (2020)Decoding Downset codes over a finite grid., , and . Electron. Colloquium Comput. Complex., (2019)On the Probabilistic Degrees of Symmetric Boolean Functions., , and . FSTTCS, volume 150 of LIPIcs, page 28:1-28:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)