Reachability problems in nondeterministic polynomial maps on the integers

DOI10.1007/978-3-319-98654-8_38OpenAlexW2886041640MaRDI QIDQ1622995FDOQ1622995

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)

Cited In (5)

• Comments on ``Reachability of polynomial matrix descriptions (PMDs) by G. F. Fragulis and A. I. G. Vardulakis
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers
• On Reachability Problems for Low-Dimensional Matrix Semigroups
• Title not available (Why is that?)
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Polynomial-time algorithm for fixed points of nontrivial morphisms 👍 👎
• Reachability computation for polynomial dynamical systems 👍 👎
• Hybrid Systems: Computation and Control 👍 👎
• On Nondeterminism, Enumeration Reducibility and Polynomial Bounds 👍 👎
• Reachability problems in low-dimensional nondeterministic polynomial maps over integers 👍 👎
• Reachability problem for polynomial iteration is PSPACE-complete 👍 👎
• Arithmetic constraints of polynomial maps through discrete logarithms 👍 👎
• Extending continuous maps 👍 👎

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)