No. Title Author Year
1 Beyond Natural Proofs: Hardness Magnification and Locality Chen, Lijie et al. 2020
2 Hardness Magnification near State-Of-The-Art Lower Bounds Oliveira, Igor Carboni et al. 2019
3 Parity Helps to Compute Majority Oliveira, Igor Carboni et al. 2019
4 Randomness and Intractability in Kolmogorov Complexity Oliveira, Igor Carboni 2019
5 NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits Hirahara, Shuichi et al. 2018
6 Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness Oliveira, Igor C. Carboni et al. 2017
7 Learning Circuits with few Negations Blais, Eric et al. 2015
8 Majority is Incompressible by AC^0[p] Circuits Oliveira, Igor Carboni et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 8


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