No. Title Author Year
1 Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371) Bläser, Markus et al. 2023
2 Probabilistic Kolmogorov Complexity with Applications to Average-Case Complexity Goldberg, Halley et al. 2022
3 Front Matter, Table of Contents, Preface, Conference Organization Kabanets, Valentine 2021
4 Lifting for Constant-Depth Circuits and Applications to MCSP Carmosino, Marco et al. 2021
5 LIPIcs, Volume 200, CCC 2021, Complete Volume Kabanets, Valentine 2021
6 Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates Kabanets, Valentine et al. 2020
7 AC^0[p] Lower Bounds Against MCSP via the Coin Problem Golovnev, Alexander et al. 2019
8 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391) Bläser, Markus et al. 2019
9 Circuit Lower Bounds for MCSP from Local Pseudorandom Generators Cheraghchi, Mahdi et al. 2019
10 Satisfiability and Derandomization for Small Polynomial Threshold Circuits Kabanets, Valentine et al. 2018
11 The Power of Natural Properties as Oracles Impagliazzo, Russell et al. 2018
12 Agnostic Learning from Tolerant Natural Proofs Carmosino, Marco L. et al. 2017
13 Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411) Kabanets, Valentine et al. 2017
14 Does Looking Inside a Circuit Help? Impagliazzo, Russell et al. 2017
15 Expander Construction in VNC1 Buss, Sam et al. 2017
16 Learning Algorithms from Natural Proofs Carmosino, Marco L. et al. 2016
17 Pseudorandomness When the Odds are Against You Artemenko, Sergei et al. 2016
18 Algebra in Computational Complexity (Dagstuhl Seminar 14391) Agrawal, Manindra et al. 2015
19 The Minimum Oracle Circuit Size Problem Allender, Eric et al. 2015
20 Tighter Connections between Derandomization and Circuit Lower Bounds Carmosino, Marco L. et al. 2015
21 An Axiomatic Approach to Algebrization Impagliazzo, Russell et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 21

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