No. Title Author Year
1 Deterministically Counting Satisfying Assignments for Constant-Depth Circuits with Parity Gates, with Implications for Lower Bounds Rajgopal, Ninad et al. 2018
2 NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits Hirahara, Shuichi et al. 2018
3 Proof Complexity (Dagstuhl Seminar 18051) Atserias, Albert et al. 2018
4 Pseudo-Derandomizing Learning and Approximation Carboni Oliveira, Igor et al. 2018
5 Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness Oliveira, Igor C. Carboni et al. 2017
6 On the Average-Case Complexity of MCSP and Its Variants Hirahara, Shuichi et al. 2017
7 Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits Chen, Ruiwen et al. 2016
8 Exponential Time Paradigms Through the Polynomial Time Lens Drucker, Andrew et al. 2016
9 New Non-Uniform Lower Bounds for Uniform Classes Fortnow, Lance et al. 2016
10 Majority is Incompressible by AC^0[p] Circuits Oliveira, Igor Carboni et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 14


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