No. Title Author Year
1 Smaller ACC0 Circuits for Symmetric Functions Chapman, Brynmor et al. 2022
2 Black-Box Hypotheses and Lower Bounds Chapman, Brynmor K. et al. 2021
3 Circuit Depth Reductions Golovnev, Alexander et al. 2021
4 Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers Mudigonda, Abhijit S. et al. 2021
5 Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms Vyas, Nikhil et al. 2020
6 Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems Chen, Lijie et al. 2019
7 Stronger Connections Between Circuit Analysis and Circuit Lower Bounds, via PCPs of Proximity Chen, Lijie et al. 2019
8 Counting Solutions to Polynomial Systems via Reductions Williams, R. Ryan 2018
9 Easiness Amplification and Uniform Circuit Lower Bounds Murray, Cody D. et al. 2017
10 Deterministic Time-Space Trade-Offs for k-SUM Lincoln, Andrea et al. 2016
11 On the (Non) NP-Hardness of Computing Circuit Complexity Murray, Cody D. et al. 2015
12 Thinking Algorithmically About Impossibility (Invited Talk) Williams, R. Ryan 2015
Current Page :
Number of result pages: 1
Number of documents: 12

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI