Mikito Nanashima

Orcid: 0009-0002-4064-1462

According to our database1, Mikito Nanashima authored at least 13 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
2
2
1
1
1
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
One-Way Functions and Zero Knowledge.
Electron. Colloquium Comput. Complex., 2024

Optimal Coding for Randomized Kolmogorov Complexity and Its Applications.
Electron. Colloquium Comput. Complex., 2024

2023
Learning in Pessiland via Inductive Inference.
Electron. Colloquium Comput. Complex., 2023

A Duality Between One-Way Functions and Average-Case Symmetry of Information.
Electron. Colloquium Comput. Complex., 2023

2022
Learning versus Pseudorandom Generators in Constant Parallel Time.
Electron. Colloquium Comput. Complex., 2022

Finding Errorless Pessiland in Error-Prone Heuristica.
Proceedings of the 37th Computational Complexity Conference, 2022

2021
On Worst-Case Learning in Relativized Heuristica.
Electron. Colloquium Comput. Complex., 2021

A Theory of Heuristic Learnability.
Proceedings of the Conference on Learning Theory, 2021

2020
On Basing Auxiliary-Input Cryptography on NP-hardness via Nonadaptive Black-Box Reductions.
Electron. Colloquium Comput. Complex., 2020

Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning.
Proceedings of the Conference on Learning Theory, 2020

A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields.
Proceedings of the Algorithmic Learning Theory, 2020

2019
A Faster Algorithm Enumerating Relevant Features over Finite Fields.
CoRR, 2019

2018
Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018


  Loading...