Reachability problem for polynomial iteration is PSPACE-complete (Q1685792)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reachability problem for polynomial iteration is PSPACE-complete |
scientific article; zbMATH DE number 6820349
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reachability problem for polynomial iteration is PSPACE-complete |
scientific article; zbMATH DE number 6820349 |
Statements
Reachability problem for polynomial iteration is PSPACE-complete (English)
0 references
20 December 2017
0 references
reachability problem
0 references
polynomial iteration
0 references
decidability
0 references
