On Affine Reachability Problems
From MaRDI portal
Publication:5089216
DOI10.4230/LIPIcs.MFCS.2020.48OpenAlexW3082487952MaRDI QIDQ5089216
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1905.05114
Related Items (2)
Reachability problems in low-dimensional nondeterministic polynomial maps over integers ⋮ An algebraic view on p-admissible concrete domains for lightweight description logics
Cites Work
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reachability problem for polynomial iteration is PSPACE-complete
- The mortality problem for matrices of low dimensions
- Reachability in two-clock timed automata is PSPACE-complete
- Reachability in Register Machines with Polynomial Updates
- Mortality for 2 ×2 Matrices Is NP-Hard
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
- Reachability Problems for One-Dimensional Piecewise Affine Maps
- On the Complexity of the Orbit Problem
- Integer Vector Addition Systems with States
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- Decidability of the Membership Problem for 2 × 2 integer matrices
- The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete
- Some decision problems on integer matrices
- Decision Problems for Linear Recurrence Sequences
- The Complexity of Reachability in Affine Vector Addition Systems with States
- The reachability problem for Petri nets is not elementary
- Mortality of iterated piecewise affine functions over the integers: Decidability and complexity
- Membership Problem for the Modular Group
- Mortality Problem for 2×2 Integer Matrices
- Unsolvability in 3 × 3 Matrices
This page was built for publication: On Affine Reachability Problems
