Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matrices of integers (15B36) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A note on Post's correspondence problem
- Recursive Solvability of Problems with Matrices
- The Complexity of Markov Decision Processes
- The boundedness of all products of a pair of matrices is undecidable
- Unsolvability in 3 × 3 Matrices
Cited in
(36)- Set of possible values of maximal Lyapunov exponents of discrete time-varying linear system
- Lifespan in a primitive Boolean linear dynamical system
- Flatness and structural analysis as a constructive framework for private communication
- Polytopic uncertainty for linear systems: new and old complexity results
- Periodic sequences of arbitrage: a tale of four currencies
- Post Correspondence Problem and Small Dimensional Matrices
- Mortality for \(2 \times 2\) matrices is NP-hard
- Cocyclic subshifts from Diophantine equations
- Chaotic behavior of discrete-time linear inclusion dynamical systems
- On the Lyapunov exponents of a class of second-order discrete time linear systems with bounded perturbations
- Mortality Problem for 2×2 Integer Matrices
- Analytic expansions of max-plus Lyapunov exponents.
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- On undecidability bounds for matrix decision problems
- A Collatz-type conjecture on the set of rational numbers
- A survey of computational complexity results in systems and control
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Continuity properties of the lower spectral radius
- Optimal Switching Sequence for Switched Linear Systems
- The boundedness of all products of a pair of matrices is undecidable
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- Monomial reachability and zero controllability of discrete-time positive switched systems
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Examples of undecidable problems for 2-generator matrix semigroups
- Improved matrix pair undecidability results
- Uniformity of Lyapunov exponents for non-invertible matrices
- Undecidability bounds for integer matrices using Claus instances
- Mortality problem and affine automata
- On feedback stabilization of linear switched systems via switching signal control
- Optimization problems involving matrix multiplication with applications in materials science and biology
- Consensus in asynchronous multiagent systems. III: Constructive stability and stabilizability
- The ultimate rank of tropical matrices
- Some criteria for spectral finiteness of a finite subset of the real matrix space \(\mathbb R^{d\times d}\)
- The mortality problem for matrices of low dimensions
- On the decidability of semigroup freeness.
This page was built for publication: When is a pair of matrices mortal?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290262)
