No. |
Title |
Author |
Year |
---|

1 |
Kolmogorov Complexity Characterizes Statistical Zero Knowledge |
Allender, Eric et al. |
2023 |

2 |
Learning Versus Pseudorandom Generators in Constant Parallel Time |
Hirahara, Shuichi et al. |
2023 |

3 |
Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions |
Chen, Lijie et al. |
2022 |

4 |
Errorless Versus Error-Prone Average-Case Complexity |
Hirahara, Shuichi et al. |
2022 |

5 |
Excluding PH Pessiland |
Hirahara, Shuichi et al. |
2022 |

6 |
Finding Errorless Pessiland in Error-Prone Heuristica |
Hirahara, Shuichi et al. |
2022 |

7 |
Symmetry of Information from Meta-Complexity |
Hirahara, Shuichi |
2022 |

8 |
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity |
Allender, Eric et al. |
2021 |

9 |
Hardness of Constant-Round Communication Complexity |
Hirahara, Shuichi et al. |
2021 |

10 |
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP |
Cheraghchi, Mahdi et al. |
2021 |

11 |
Test of Quantumness with Small-Depth Quantum Circuits |
Hirahara, Shuichi et al. |
2021 |

12 |
Beyond Natural Proofs: Hardness Magnification and Locality |
Chen, Lijie et al. |
2020 |

13 |
Non-Disjoint Promise Problems from Meta-Computational View of Pseudorandom Generator Constructions |
Hirahara, Shuichi |
2020 |

14 |
On Nonadaptive Security Reductions of Hitting Set Generators |
Hirahara, Shuichi et al. |
2020 |

15 |
Unexpected Power of Random Strings |
Hirahara, Shuichi |
2020 |

16 |
NP-hardness of Minimum Circuit Size Problem for OR-AND-MOD Circuits |
Hirahara, Shuichi et al. |
2018 |

17 |
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems |
Allender, Eric et al. |
2017 |

18 |
On the Average-Case Complexity of MCSP and Its Variants |
Hirahara, Shuichi et al. |
2017 |

19 |
Limits of Minimum Circuit Size Problem as Oracle |
Hirahara, Shuichi et al. |
2016 |

20 |
Identifying an Honest EXP^NP Oracle Among Many |
Hirahara, Shuichi |
2015 |