A Logspace Constructive Proof of L=SL

MaRDI QIDQ7203550arXivFDO

Authors Samuel R. Buss, Anant Dhayal, Valentine Kabanets, Antonina Kolokolova, Sasank Mouli

Publication date 2025

Published in arXiv

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

arXiv classification

cs.LO

This page was built for publication: A Logspace Constructive Proof of L=SL

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