Reachability problems in nondeterministic polynomial maps on the integers
type: Item
instance of: scholarly article
title: Reachability problems in nondeterministic polynomial maps on the integers
DOI: 10.1007/978-3-319-98654-8_38
author: Sang-Ki Ko
author: Reino Niskanen
author: Igor Potapov
publication date: 2018-11-22T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6983400
MaRDI profile type: Publication
OpenAlex ID: W2886041640
Recommended article: Reachability problems in low-dimensional nondeterministic polynomial maps over integers
Recommended article: Reachability computation for polynomial dynamical systems
Recommended article: Extending continuous maps
Recommended article: On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
Recommended article: Q3983271
Recommended article: Hybrid Systems: Computation and Control
Recommended article: Polynomial-time algorithm for fixed points of nontrivial morphisms
Recommended article: Reachability problem for polynomial iteration is PSPACE-complete
Recommended article: Arithmetic constraints of polynomial maps through discrete logarithms
Recommended article: Q3691063
description: scientific article; zbMATH DE number 6983400