Learning in Pessiland via inductive inference

DOI10.1109/FOCS57990.2023.00033MaRDI QIDQ6942940zbMATH OpenFDO

Authors Mikito Nanashima, Shuichi Hirahara

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00033

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(6)

• One-way functions and pKt complexity
• On one-way functions, the worst-case hardness of time-bounded Kolmogorov complexity, and computational depth
• Learning algorithms from circuit lower bounds
• On witness encryption and laconic zero-knowledge arguments
• Quantum cryptography and meta-complexity
• Hardness along the boundary: towards one-way functions from the worst-case hardness of time-bounded Kolmogorov complexity

This page was built for publication: Learning in Pessiland via inductive inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942940)