Reachability problem for polynomial iteration is PSPACE-complete

DOI10.1007/978-3-319-67089-8_10zbMath1478.68090OpenAlexW2745665581MaRDI QIDQ1685792

Reino Niskanen

Publication date: 20 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-67089-8_10

zbMATH Keywords

polynomial iterationdecidabilityreachability problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ On Affine Reachability Problems

This page was built for publication: Reachability problem for polynomial iteration is PSPACE-complete