Pages that link to "Item:Q1111023"
From MaRDI portal
The following pages link to Parallel algorithms for solvable permutation groups (Q1111023):
Displaying 10 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- The parallel complexity of graph canonization under abelian group action (Q378219) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Membership testing in commutative transformation semigroups (Q1108790) (← links)
- Group graphs and computational symmetry on massively parallel architecture (Q1186813) (← links)
- Parallel algorithms for separable permutations (Q1763485) (← links)
- Monte Carlo circuits for the abelian permutation group intersection problem (Q1820579) (← links)
- The Parallel Complexity of Abelian Permutation Group Problems (Q3792240) (← links)
- Sequential-Merge Facets for Two-Dimensional Group Problems (Q5429255) (← links)
- On the complexity of some problems on groups input as multiplication tables (Q5956010) (← links)