No. Title Author Year
1 Satisfiability and Derandomization for Small Polynomial Threshold Circuits Kabanets, Valentine et al. 2018
2 The Power of Natural Properties as Oracles Impagliazzo, Russell et al. 2018
3 Agnostic Learning from Tolerant Natural Proofs Carmosino, Marco L. et al. 2017
4 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) Kabanets, Valentine et al. 2017
5 Does Looking Inside a Circuit Help? Impagliazzo, Russell et al. 2017
6 Expander Construction in VNC1 Buss, Sam et al. 2017
7 Learning Algorithms from Natural Proofs Carmosino, Marco L. et al. 2016
8 Pseudorandomness When the Odds are Against You Artemenko, Sergei et al. 2016
9 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Agrawal, Manindra et al. 2015
10 The Minimum Oracle Circuit Size Problem Allender, Eric et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 12

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