国際会議発表 (査読有り)

• Mikito Nanashima. A Non-Trivial Algorithm Enumerating Relevant Features over Finite Fields, the 31st International Conference on Algorithmic Learning Theory, Proceedings of Machine Learning Research, PMLR, vol. 117, pp. 660-686, Feb. 2020.  公式リンク  
  
• Mikito Nanashima. Cryptographic Limitations on Polynomial-time a Posteriori Query Learning, 29th International Workshop on Combinatorial Algorithms, IWOCA18, Lecture notes in computer science, LNCS, volume 10979, pp. 285-297, July 2018.

国内会議発表 (査読なし・不明)

• 七島 幹人. 多項式時間所属質問学習の限界解析, COMP, 信学技報, vol. 117, no. 474, pp. 21-26, Mar. 2018.

その他の論文・著書など

• Mikito Nanashima. A Faster Algorithm Enumerating Relevant Features over Finite Fields, arXiv:1903.06412, Mar. 2019.

学位論文

• Learning Theory in Heuristica and Pessiland,  Thesis,  Doctor (Science),  Tokyo Institute of Technology,  2023/03/26,   
• Learning Theory in Heuristica and Pessiland,  Exam Summary,  Doctor (Science),  Tokyo Institute of Technology,  2023/03/26,   
• Learning Theory in Heuristica and Pessiland,  Summary,  Doctor (Science),  Tokyo Institute of Technology,  2023/03/26,   

[ BibTeX 形式で保存 ]    [ 論文・著書をCSV形式で保存 ]    [ 特許をCSV形式で保存 ]