Cryptographic Limitations on Polynomial-Time a Posteriori Query Learning. - Mikito Nanashima (IWOCA, 2018)

A Faster Algorithm Enumerating Relevant Features over Finite Fields. - Mikito Nanashima (CoRR, 2019)

A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields. - Mikito Nanashima (ALT, 2020)

Extending Learnability to Auxiliary-Input Cryptographic Primitives and Meta-PAC Learning. - Mikito Nanashima (COLT, 2020)

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

A Theory of Heuristic Learnability. - Mikito Nanashima (COLT, 2021)

On Worst-Case Learning in Relativized Heuristica. - Shuichi Hirahara; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2021)

Finding Errorless Pessiland in Error-Prone Heuristica. - Shuichi Hirahara; Mikito Nanashima (CCC, 2022)

Learning versus Pseudorandom Generators in Constant Parallel Time. - Shuichi Hirahara; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2022)

A Duality Between One-Way Functions and Average-Case Symmetry of Information. - Shuichi Hirahara; Rahul Ilango; Zhenjian Lu; Mikito Nanashima; Igor Carboni Oliveira (Electron. Colloquium Comput. Complex., 2023)

Learning in Pessiland via Inductive Inference. - Shuichi Hirahara; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2023)

Optimal Coding for Randomized Kolmogorov Complexity and Its Applications. - Shuichi Hirahara; Zhenjian Lu; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2024)

One-Way Functions and Zero Knowledge. - Shuichi Hirahara; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2024)

Complexity-Theoretic Inductive Inference. - Shuichi Hirahara; Mikito Nanashima (Electron. Colloquium Comput. Complex., 2025)