No. Title Author Year
1 Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness Oliveira, Igor C. Carboni et al. 2017
2 On the Average-Case Complexity of MCSP and Its Variants Hirahara, Shuichi et al. 2017
3 Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits Chen, Ruiwen et al. 2016
4 Exponential Time Paradigms Through the Polynomial Time Lens Drucker, Andrew et al. 2016
5 New Non-Uniform Lower Bounds for Uniform Classes Fortnow, Lance et al. 2016
6 Majority is Incompressible by AC^0[p] Circuits Oliveira, Igor Carboni et al. 2015
7 Optimal algorithms and proofs (Dagstuhl Seminar 14421) Beyersdorff, Olaf et al. 2015
8 Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes Jansen, Maurice et al. 2012
9 Unconditional Lower Bounds against Advice Buhrman, Harry et al. 2010
10 Fractional Pebbling and Thrifty Branching Programs Braverman, Mark et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Fulltext Search | Imprint Published by LZI