PSPACE-completeness of reversible deterministic systems
type: Item
instance of: scholarly article
title: PSPACE-completeness of reversible deterministic systems
DOI: 10.1007/978-3-031-13502-6_7
author: Erik D. Demaine
author: Robert A. Hearn
author: Dylan Hendrickson
author: Jayson Lynch
publication date: 2022-12-09T00:00:00Z
full work available at URL: https://arxiv.org/abs/2207.07229
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7630823
MaRDI profile type: Publication
OpenAlex ID: W4290017147
cites work: Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
cites work: Q3305736
cites work: Q5875768
cites work: Energy-efficient algorithms
cites work: Conservative logic
cites work: Q3395518
cites work: Recognizing the repeatable configurations of time-reversible generalized Langton's ant is PSPACE-hard
description: scientific article; zbMATH DE number 7630823