Parallel algorithms for solvable permutation groups
nilpotent groupsparallel algorithmsparallel complexityautomorphism of graphspower commutator basissolvable permutation groups
Analysis of algorithms and problem complexity (68Q25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) General theory for finite permutation groups (20B05) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3865540 (Why is no real title available?)
- scientific article; zbMATH DE number 3825202 (Why is no real title available?)
- scientific article; zbMATH DE number 3968860 (Why is no real title available?)
- scientific article; zbMATH DE number 3722702 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- scientific article; zbMATH DE number 3412857 (Why is no real title available?)
- scientific article; zbMATH DE number 3058928 (Why is no real title available?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- A polynomial bound for the orders of primitive solvable groups
- A taxonomy of problems with fast parallel algorithms
- An Algorithm for Finding the Blocks of a Permutation Group
- Computing the composition factors of a permutation group in polynomial time
- Fast parallel matrix and GCD computations
- Graphs and finite permutation groups
- Group-theoretic algorithms and graph isomorphism
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On Relating Time and Space to Size and Depth
- On the complexity of intersection and conjugacy problems in free groups
- On the orders of primitive groups with restricted nonabelian composition factors
- Polynomial-time algorithms for finding elements of prime order and sylow subgroups
- Polynomial-time versions of Sylow's theorem
- Solvable and Nilpotent Subgroups of GL(n,qm)
- Sylow's theorem in polynomial time
- The Nielsen reduction and P-complete problems in free groups
- The Parallel Complexity of Abelian Permutation Group Problems
- The network complexity and the Turing machine complexity of finite functions
- Towards a complexity theory of synchronous parallel computation
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- The complexity of intersecting finite automata having few final states
- Sequential-Merge Facets for Two-Dimensional Group Problems
- The Parallel Complexity of Abelian Permutation Group Problems
- scientific article; zbMATH DE number 841570 (Why is no real title available?)
- Monte Carlo circuits for the abelian permutation group intersection problem
- Parallel algorithms for separable permutations
- On the complexity of some problems on groups input as multiplication tables
- Group graphs and computational symmetry on massively parallel architecture
- scientific article; zbMATH DE number 475363 (Why is no real title available?)
- Membership testing in commutative transformation semigroups
- The parallel complexity of graph canonization under abelian group action
This page was built for publication: Parallel algorithms for solvable permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111023)
