PSPACE-completeness of reversible deterministic systems (Q6902485)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8118953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of reversible deterministic systems |
scientific article; zbMATH DE number 8118953 |
Statements
PSPACE-completeness of reversible deterministic systems (English)
0 references
11 November 2025
0 references
reversible computing
0 references
computational complexity
0 references
constraint logic
0 references
PSpace
0 references
0 references
