Pages that link to "Item:Q1611897"
From MaRDI portal
The following pages link to The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897):
Displaying 25 items.
- Scalable control of positive systems (Q522876) (← links)
- The continuous Skolem-Pisot problem (Q708215) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Effective results on the Skolem problem for linear recurrence sequences (Q1634425) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Variation diminishing linear time-invariant systems (Q2063768) (← links)
- On the multiplicities of Padovan-type sequences (Q2091206) (← links)
- Minimal positive realizations: A survey (Q2158979) (← links)
- On recurrences converging to the wrong limit in finite precision and some new examples (Q2203376) (← links)
- The minimal realization problem in the max-plus semiring and Pisot's problem are \(NP\)-hard (Q2778041) (← links)
- Orbits of Linear Maps and Regular Languages (Q3007635) (← links)
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- D0L sequence equivalence is in<i>P</i>for fixed alphabets (Q3515467) (← links)
- On Second-Order Cone Positive Systems (Q5009774) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
- Complexity of Restricted Variants of Skolem and Related Problems (Q5111295) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Compound matrices in systems and control theory: a tutorial (Q6073118) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)
- On robustness for the Skolem, positivity and ultimate positivity problems (Q6563058) (← links)
- Computing the density of the positivity set for linear recurrence sequences (Q6649431) (← links)
- On the Skolem problem and the Skolem conjecture (Q6649433) (← links)
