Towards a complexity theory of parallel computation

DOI10.1145/3588287.3588295MaRDI QIDQ6979514zbMATH OpenFDO

Authors Paul Beame, Pierre McKenzie

Publication date 25 May 2025

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

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: Towards a complexity theory of parallel computation

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