Reachability problems in nondeterministic polynomial maps on the integers

DOI10.1007/978-3-319-98654-8_38MaRDI QIDQ1622995zbMATH OpenOpenAlexFDO

Authors Sang-Ki Ko, Reino Niskanen, Igor Potapov

Publication date 22 November 2018

Full work available at URL https://ora.ox.ac.uk/objects/uuid:f69fe662-b4c4-43e6-b4a8-9caa4cde9ed5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• Reachability computation for polynomial dynamical systems
• Extending continuous maps, polynomiality and undecidability
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds
• scientific article; zbMATH DE number 26547
• Hybrid Systems: Computation and Control
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Reachability problem for polynomial iteration is PSPACE-complete
• Arithmetic constraints of polynomial maps through discrete logarithms
• scientific article; zbMATH DE number 3915627

Cited in

(8)

• Comments on ``Reachability of polynomial matrix descriptions (PMDs) by G. F. Fragulis and A. I. G. Vardulakis
• About the decision of reachability for register machines
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• Reachability problem for polynomial iteration is PSPACE-complete
• Reachability problems for PAMs
• On Reachability Problems for Low-Dimensional Matrix Semigroups
• scientific article; zbMATH DE number 3915627 (Why is no real title available?)
• scientific article; zbMATH DE number 5790349 (Why is no real title available?)

This page was built for publication: Reachability problems in nondeterministic polynomial maps on the integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622995)