Reachability problem for polynomial iteration is PSPACE-complete
type: Item
instance of: scholarly article
title: Reachability problem for polynomial iteration is PSPACE-complete
zbMATH Open document ID: 1478.68090
DOI: 10.1007/978-3-319-67089-8_10
author: Reino Niskanen
publication date: 2017-12-20T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6820349
zbMATH Keywords: reachability problem
zbMATH Keywords: polynomial iteration
zbMATH Keywords: decidability
MaRDI profile type: Publication
full work available at URL: 978-3-319-67089-8 10
OpenAlex ID: W2745665581
description: scientific article; zbMATH DE number 6820349