Mikito Nanashima

According to our database, Mikito Nanashima authored at least 14 papers between 2018 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Complexity-Theoretic Inductive Inference.

Shuichi Hirahara, Mikito Nanashima

Electron. Colloquium Comput. Complex., 2025

2024

One-Way Functions and Zero Knowledge.

Shuichi Hirahara, Mikito Nanashima

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Optimal Coding for Randomized Kolmogorov Complexity and Its Applications.

Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

A Duality between One-Way Functions and Average-Case Symmetry of Information.

Shuichi Hirahara, Rahul Ilango, Zhenjian Lu, Mikito Nanashima, Igor C. Oliveira

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Learning Versus Pseudorandom Generators in Constant Parallel Time.

Shuichi Hirahara, Mikito Nanashima

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Learning in Pessiland via Inductive Inference.

Shuichi Hirahara, Mikito Nanashima

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Finding Errorless Pessiland in Error-Prone Heuristica.

Shuichi Hirahara, Mikito Nanashima

Proceedings of the 37th Computational Complexity Conference, 2022

2021

On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions.

Mikito Nanashima

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

On Worst-Case Learning in Relativized Heuristica.

Shuichi Hirahara, Mikito Nanashima

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

A Theory of Heuristic Learnability.

Mikito Nanashima

Proceedings of the Conference on Learning Theory, 2021

2020

Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning.

Mikito Nanashima

Proceedings of the Conference on Learning Theory, 2020

A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields.

Mikito Nanashima

Proceedings of the Algorithmic Learning Theory, 2020

2019

A Faster Algorithm Enumerating Relevant Features over Finite Fields.

Mikito Nanashima

CoRR, 2019

2018

Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning.

Mikito Nanashima

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018