Rchr
J-GLOBAL ID:201901019808988915   Update date: May. 19, 2024

Nanashima Mikito

ナナシマ ミキト | Nanashima Mikito
Affiliation and department:
Homepage URL  (1): https://nanashima.github.io/
Research field  (1): Information theory
Research theme for competitive and other funds  (3):
  • 2022 - 2027 Theoretical Foundations of Resource-Bounded Quantum Computation
  • 2021 - 2023 学習階層の解析と計算論的学習理論の新展開
  • 2019 - 2022 Research on Difficulty of Proving Efficient Learnability
Papers (11):
  • Shuichi Hirahara, Mikito Nanashima. Learning in Pessiland via Inductive Inference. FOCS. 2023. 447-457
  • Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira. A Duality between One-Way Functions and Average-Case Symmetry of Information. STOC. 2023. 1039-1050
  • Shuichi Hirahara, Mikito Nanashima. Learning Versus Pseudorandom Generators in Constant Parallel Time. ITCS. 2023. 70-18
  • Shuichi Hirahara, Mikito Nanashima. Finding Errorless Pessiland in Error-Prone Heuristica. CCC. 2022. 25-28
  • Shuichi Hirahara, Mikito Nanashima. On Worst-Case Learning in Relativized Heuristica. Electronic Colloquium on Computational Complexity. 2021. 28. 161-161
more...
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page