No. Title Author Year
1 One-Tape Turing Machine and Branching Program Lower Bounds for MCSP Cheraghchi, Mahdi et al. 2021
2 Beyond Natural Proofs: Hardness Magnification and Locality Chen, Lijie et al. 2020
3 Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions Hirahara, Shuichi 2020
4 On Nonadaptive Security Reductions of Hitting Set Generators Hirahara, Shuichi et al. 2020
5 Unexpected Power of Random Strings Hirahara, Shuichi 2020
6 NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits Hirahara, Shuichi et al. 2018
7 New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems Allender, Eric et al. 2017
8 On the Average-Case Complexity of MCSP and Its Variants Hirahara, Shuichi et al. 2017
9 Limits of Minimum Circuit Size Problem as Oracle Hirahara, Shuichi et al. 2016
10 Identifying an Honest EXP^NP Oracle Among Many Hirahara, Shuichi 2015
Current Page :
Number of result pages: 1
Number of documents: 10


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