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

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