No. Title Author Year
1 Algorithms and Lower Bounds for Comparator Circuits from Shrinkage Cavalar, Bruno P. et al. 2022
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 Circuit Lower Bounds for MCSP from Local Pseudorandom Generators Cheraghchi, Mahdi et al. 2019
8 Satisfiability and Derandomization for Small Polynomial Threshold Circuits Kabanets, Valentine et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 8


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