Pages that link to "Item:Q3462041"
From MaRDI portal
The following pages link to Polynomial-time algorithm for the orbit problem (Q3462041):
Displayed 16 items.
- A linear-time algorithm for the orbit problem over cyclic groups (Q303693) (← links)
- Continuous-time orbit problems are decidable in polynomial-time (Q458374) (← links)
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- The orbit problem is in the GapL hierarchy (Q626456) (← links)
- The continuous Skolem-Pisot problem (Q708215) (← links)
- On the membership of invertible diagonal and scalar matrices (Q870838) (← links)
- Polynomial ring automorphisms, rational \((w,\sigma )\)-canonical forms, and the assignment problem (Q972847) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- On solutions of linear ordinary difference equations in their coefficient field (Q1581126) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- The Invariance Problem for Matrix Semigroups (Q2811359) (← links)
- On the decidability of semigroup freeness (Q2905326) (← links)
- Reachability in Linear Dynamical Systems (Q3507439) (← links)
- The Orbit Problem Is in the GapL Hierarchy (Q3511324) (← links)
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (Q3601323) (← links)
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS (Q5483458) (← links)