A Fixed-Depth Size-Hierarchy Theorem For Ac(0)[Circle Plus] Via The Coin Problem | 0 | 0.34 | 2021 |
On The Probabilistic Degrees Of Symmetric Boolean Functions | 0 | 0.34 | 2021 |
Decoding Variants of Reed-Muller Codes over Finite Grids | 0 | 0.34 | 2020 |
More on $AC^0[oplus]$ and Variants of the Majority Function. | 0 | 0.34 | 2019 |
A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem | 0 | 0.34 | 2019 |
On the Probabilistic Degrees of Symmetric Boolean Functions. | 0 | 0.34 | 2019 |
Decoding Downset codes over a finite grid. | 0 | 0.34 | 2019 |
More on AC0[oplus] and Variants of the Majority Function. | 0 | 0.34 | 2019 |
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. | 1 | 0.35 | 2018 |