No. Title Author Year
1 Constant-Depth Circuits vs. Monotone Circuits Cavalar, Bruno P. et al. 2023
2 Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity Lu, Zhenjian et al. 2022
3 Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity Goldberg, Halley et al. 2022
4 An Efficient Coding Theorem via Probabilistic Representations and Its Applications Lu, Zhenjian et al. 2021
5 Majority vs. Approximate Linear Sum and Average-Case Complexity Below NCĀ¹ Chen, Lijie et al. 2021
6 Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates Kabanets, Valentine et al. 2020
7 Beyond Natural Proofs: Hardness Magnification and Locality Chen, Lijie et al. 2020
8 NP-Hardness of Circuit Minimization for Multi-Output Functions Ilango, Rahul et al. 2020
9 NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits Hirahara, Shuichi et al. 2018
10 Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness Oliveira, Igor C. Carboni et al. 2017
11 Learning Circuits with few Negations Blais, Eric et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 11

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