No. Title Author Year
1 AC^0[p] Lower Bounds Against MCSP via the Coin Problem Golovnev, Alexander et al. 2019
2 Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity Carmosino, Marco L. et al. 2018
3 Half-Duplex Communication Complexity Hoover, Kenneth et al. 2018
4 Hardness Amplification for Non-Commutative Arithmetic Circuits Carmosino, Marco L. et al. 2018
5 Stabbing Planes Beame, Paul 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 Does Looking Inside a Circuit Help? Impagliazzo, Russell et al. 2017
9 Learning Algorithms from Natural Proofs Carmosino, Marco L. et al. 2016
10 Pseudorandomness When the Odds are Against You Artemenko, Sergei et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 12


DROPS-Home | Imprint | Privacy Published by LZI