A Fixed-Depth Size-Hierarchy Theorem For Ac(0)[Circle Plus] Via The Coin Problem | 0 | 0.34 | 2021 |
A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem | 0 | 0.34 | 2019 |
On the Complexity of Hazard-free Circuits | 0 | 0.34 | 2019 |
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. | 1 | 0.35 | 2018 |
Space-Efficient Approximations for Subset Sum. | 0 | 0.34 | 2016 |
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. | 0 | 0.34 | 2016 |
A Game Characterisation of Tree-like Q-resolution Size. | 3 | 0.40 | 2014 |
Monomials, multilinearity and identity testing in simple read-restricted circuits | 1 | 0.36 | 2014 |
Building above Read-once Polynomials: Identity Testing and Hardness of Representation. | 3 | 0.38 | 2014 |
Small Depth Proof Systems. | 0 | 0.34 | 2013 |
Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs | 2 | 0.37 | 2012 |
Counting paths in planar width 2 branching programs | 2 | 0.37 | 2012 |
Verifying Proofs In Constant Depth | 0 | 0.34 | 2012 |
The Complexity of Unary Subset Sum. | 0 | 0.34 | 2012 |
Verifying proofs in constant depth | 1 | 0.37 | 2011 |