Rchr
J-GLOBAL ID:201801012931793647   Update date: Apr. 19, 2021

Hirahara Shuichi

ヒラハラ シュウイチ | Hirahara Shuichi
Affiliation and department:
Job title: Assistant Professor
Research field  (1): Information theory
Research keywords  (3): Kolmogorov Complexity ,  Minimum Circuit Size Problem ,  Complexity Theory
Research theme for competitive and other funds  (7):
  • 2020 - 2025 New computational models for algorithms and discrete optimization
  • 2020 - 2024 Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications
  • 2020 - 2024 メタな視点に基づく計算量理論の新展開
  • 2018 - 2022 Computational Complexity of Minimum Description Size Problems
  • 2019 - 2021 安全な暗号の確立に向けた回路最小化問題の計算困難性の解析
Show all
Papers (21):
  • Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida. One-tape Turing machine and branching program lower bounds for MCSP. The 38th International Symposium on Theoretical Aspects of Computer Science. 2021
  • Shuichi Hirahara, Nobutaka Shimizu. Nearly Optimal Average-Case Complexity of Counting Bicliques Under SETH. ACM-SIAM Symposium on Discrete Algorithms (SODA 2021). 2021
  • Shinji Ito, Shuichi Hirahara, Tasuku Soma, Yuichi Yoshida. Tight First- and Second-Order Regret Bounds for Adversarial Linear Bandits. Conference on Neural Information Processing Systems (NeurIPS 2020). 2020
  • Shuichi Hirahara, Osamu Watanabe. On Nonadaptive Security Reductions of Hitting Set Generators. International Conference on Randomization and Computation (RANDOM 2020). 2020
  • Shuichi Hirahara. Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity. 61th IEEE Annual Symposium on Foundations of Computer Science (FOCS 2020). 2020
more...
MISC (2):
  • 平原 秀一. 「メタ計算量理論」について. LAシンポジウム会誌. 2021. 76
  • 平原 秀一. 回路最小化問題と計算量理論の近年の動向について. LAシンポジウム会誌. 2016
Lectures and oral presentations  (7):
  • Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions
    (Dagstuhl seminar 2021)
  • 平均時計算量に対するメタ計算量によるアプローチ
    (東京大学 コンピュータ科学専攻講演会 2021)
  • Meta-complexity theoretic approach to complexity theory
    (Oxford-Warwick Complexity Meetings 2020)
  • メタ計算量の近年の進展について
    (離散数学とその応用研究集会(JCCA) 2020)
  • NPの最悪時及び平均時計算量について
    (COMP 学生シンポジウム 2020)
more...
Professional career (1):
  • Ph.D. (The University of Tokyo)
Committee career (1):
  • 2020/12 - 2021/01 International Computer Science Symposium in Russia (CSR 2021), Program Committee
Association Membership(s) (2):
情報処理学会 ,  電子情報通信学会
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page