Pages that link to "Item:Q2456549"
From MaRDI portal
The following pages link to Quantum automata and algebraic groups (Q2456549):
Displaying 18 items.
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Deciding universality of quantum gates (Q876334) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Constructing algebraic groups from their Lie algebras. (Q1030253) (← links)
- Embedding algorithms and applications to differential equations (Q1680163) (← links)
- Universality of single-qudit gates (Q1683949) (← links)
- Computing the Lie algebra of the differential Galois group: the reducible case (Q2117432) (← links)
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial (Q2229723) (← links)
- Linear groups and computation (Q2292421) (← links)
- Around the numeric-symbolic computation of differential Galois groups (Q2457420) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Finding Integral Linear Dependencies of Algebraic Numbers and Algebraic Lie Algebras (Q3091948) (← links)
- On the computation of the Galois group of linear difference equations (Q4600717) (← links)
- Zariski density and computing in arithmetic groups (Q4600718) (← links)
- (Q5089299) (← links)
- On Reachability Problems for Low-Dimensional Matrix Semigroups (Q5091195) (← links)
- Computing the binomial part of a polynomial ideal (Q6192534) (← links)