• A
  • A
  • A
日本語 Help
Science and technology information site for articles, patents, researchers information, etc.

Co-authoring Researcher

Co-inventing Researcher

Researcher similar to the Researcher

Article similar to the Researcher

Patent similar to the Researcher

Research Project similar to the Researcher

Article(J-GLOBAL estimation)

Patent(J-GLOBAL estimation)

Rchr
J-GLOBAL ID:201901019808988915   Update date: Jan. 21, 2025

Nanashima Mikito

ナナシマ ミキト | Nanashima Mikito
Clips
Affiliation and department:
Homepage URL  (1): https://nanashima.github.io/
Research field  (1): Information theory
Research theme for competitive and other funds  (4):
  • 2024 - 2030 メタ計算量に基づく平均時NP完全性理論の開拓
  • 2022 - 2027 Theoretical Foundations of Resource-Bounded Quantum Computation
  • 2021 - 2023 学習階層の解析と計算論的学習理論の新展開
  • 2019 - 2022 Research on Difficulty of Proving Efficient Learnability
Papers (13):
  • Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima. Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. FOCS. 2024. 369-378
  • Shuichi Hirahara, Mikito Nanashima. One-Way Functions and Zero Knowledge. STOC. 2024. 1731-1738
  • 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
more...
※ Researcher’s information displayed in J-GLOBAL is based on the information registered in researchmap. For details, see here.

Return to Previous Page