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


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