Reachability problems in low-dimensional nondeterministic polynomial maps over integers
type: Item
instance of: scholarly article
title: Reachability problems in low-dimensional nondeterministic polynomial maps over integers
author: Sang-Ki Ko
author: Reino Niskanen
author: Igor Potapov
published in: Information and Computation
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7433307
MaRDI profile type: Publication
full work available at URL: j.ic.2021.104785
OpenAlex ID: W3178445979
cites work: On the complexity of bounded time and precision reachability for piecewise affine systems
cites work: On undecidability bounds for matrix decision problems
cites work: Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
cites work: Q5144648
cites work: A survey of computational complexity results in systems and control
cites work: Deciding stability and mortality of piecewise affine dynamical systems
cites work: Q5009428
cites work: The Target Discounted-Sum Problem
cites work: Reachability Problems for One-Dimensional Piecewise Affine Maps
cites work: Context-free commutative grammars with integer counters and resets
cites work: Iterated maps on the interval as dynamical systems
cites work: A polynomial time algorithm for diophantine equations in one variable
cites work: Unboundedness Problems for Languages of Vector Addition Systems.
cites work: Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matrices
cites work: The Invariance Problem for Matrix Semigroups
cites work: Reachability in Register Machines with Polynomial Updates
cites work: Q4003572
cites work: Remarks on blind and partially blind one-way multicounter machines
cites work: Integer Vector Addition Systems with States
cites work: Q4265634
cites work: Improved matrix pair undecidability results
cites work: UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
cites work: Q3862379
cites work: On Affine Reachability Problems
cites work: Q4190159
cites work: Reducibility among Combinatorial Problems
cites work: Reachability problems in nondeterministic polynomial maps on the integers
cites work: Computability with low-dimensional dynamical systems
cites work: Reachability Problems for PAMs
cites work: REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
cites work: Decision problems for semi-Thue systems with a few rules
cites work: Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
cites work: Reachability problem for polynomial iteration is PSPACE-complete
cites work: A variant of a recursively unsolvable problem
cites work: Occurrence of zero in a linear recursive sequence
DOI: 10.1016/J.IC.2021.104785
description: scientific article; zbMATH DE number 7433307