Computation with limited space

DOI10.1145/3588287.3588296MaRDI QIDQ6979513zbMATH OpenFDO

Authors Nicholas Pippenger

Publication date 25 May 2025

Full work available at URL https://doi.org/10.1145/3588287.3588296

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Computer science (68-XX) Theory of computing (68Qxx)

This page was built for publication: Computation with limited space

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