No. Title Author Year
1 AC^0[p] Lower Bounds Against MCSP via the Coin Problem Golovnev, Alexander et al. 2019
2 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391) Bläser, Markus et al. 2019
3 Circuit Lower Bounds for MCSP from Local Pseudorandom Generators Cheraghchi, Mahdi et al. 2019
4 Satisfiability and Derandomization for Small Polynomial Threshold Circuits Kabanets, Valentine et al. 2018
5 The Power of Natural Properties as Oracles Impagliazzo, Russell et al. 2018
6 Agnostic Learning from Tolerant Natural Proofs Carmosino, Marco L. et al. 2017
7 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) Kabanets, Valentine et al. 2017
8 Does Looking Inside a Circuit Help? Impagliazzo, Russell et al. 2017
9 Expander Construction in VNC1 Buss, Sam et al. 2017
10 Learning Algorithms from Natural Proofs Carmosino, Marco L. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 15


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