A time-space lower bound for a large class of learning problems

DOI10.1109/FOCS.2017.73MaRDI QIDQ6946313zbMATH OpenFDO

Authors Ran Raz

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.73

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(3)

• On bounded storage key agreement and one-way functions
• Efficient convex optimization requires superlinear memory
• Quantum logspace algorithm for powering matrices with bounded norm

This page was built for publication: A time-space lower bound for a large class of learning problems

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