PSPACE-completeness of reversible deterministic systems

DOI10.1142/S0129054123470032MaRDI QIDQ6902485zbMATH OpenFDO

Authors Erik D. Demaine, Robert A. Hearn, Dylan Hendrickson, Jayson Lynch

Publication date 11 November 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

computational complexityreversible computingPSpaceconstraint logic

Mathematics Subject Classification ID

Applications of game theory (91A80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Other nonclassical models of computation (68Q09)

This page was built for publication: PSPACE-completeness of reversible deterministic systems

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