No. Title Author Year
1 Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates Kabanets, Valentine et al. 2020
2 AC^0[p] Lower Bounds Against MCSP via the Coin Problem Golovnev, Alexander et al. 2019
3 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391) Bläser, Markus et al. 2019
4 Circuit Lower Bounds for MCSP from Local Pseudorandom Generators Cheraghchi, Mahdi et al. 2019
5 Satisfiability and Derandomization for Small Polynomial Threshold Circuits Kabanets, Valentine et al. 2018
6 The Power of Natural Properties as Oracles Impagliazzo, Russell et al. 2018
7 Agnostic Learning from Tolerant Natural Proofs Carmosino, Marco L. et al. 2017
8 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) Kabanets, Valentine et al. 2017
9 Does Looking Inside a Circuit Help? Impagliazzo, Russell et al. 2017
10 Expander Construction in VNC1 Buss, Sam et al. 2017
11 Learning Algorithms from Natural Proofs Carmosino, Marco L. et al. 2016
12 Pseudorandomness When the Odds are Against You Artemenko, Sergei et al. 2016
13 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Agrawal, Manindra et al. 2015
14 The Minimum Oracle Circuit Size Problem Allender, Eric et al. 2015
15 Tighter Connections between Derandomization and Circuit Lower Bounds Carmosino, Marco L. et al. 2015
16 An Axiomatic Approach to Algebrization Impagliazzo, Russell et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 16

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