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):
Displayed 7 items.
- The continuous Skolem-Pisot problem (Q708215) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Explicit test sets for iterated morphisms in free monoids and metabelian groups (Q1763708) (← 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)
- A survey of computational complexity results in systems and control (Q5926262) (← links)