Pages that link to "Item:Q2893294"
From MaRDI portal
The following pages link to On the computational complexity of matrix semigroup problems (Q2893294):
Displaying 14 items.
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- Reachability problems in quaternion matrix and rotation semigroups (Q958311) (← links)
- Linear complexity algorithm for semiseparable matrices (Q1378051) (← links)
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) (Q1740664) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2971140) (← links)
- Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2988836) (← links)
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS (Q3069735) (← links)
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
- Relations in the semigroup of 2 × 2 upper-triangular matrices (Q4960461) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- (Q5111259) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
- Semigroup intersection problems in the Heisenberg groups (Q6654128) (← links)
