A number of basic problems involving solvable and nilpotent permutation groups are shown to have fast parallel solutions. Testing solvability is in NC as ...
scholar.google.com › citations
For nilpotent groups we further develop NC algorithms to compute pointwise set stabilizers and central series. We also suggest applications of the pointwise set.
Parallel algorithms for solvable permutation groups. Computing methodologies · Parallel computing methodologies · Parallel algorithms · Mathematics of computing.
This paper discusses learning algorithms for ascertaining membership, inclusion, and equality in permutation groups. The main results are randomized ...
(6) Find the pointwise-set-stabilizer of a given subset of the permutation domain. Note that (1)-(4) have been solved previously only for solvable groups, (5) ...
... solvable permutation groups ... nilpotent groupsparallel algorithmsparallel complexityautomorphism of graphspower commutator basissolvable permutation groups.
An algorithm for the construction of finite solvable groups of small order is given. A parallelized version under PVM is presented. Different models for ...
A number of basic problems involving solvable and nilpotent permutation groups are shown to have fast parallel solutions. Testing solvability is in NC as ...
We develop fast parallel solutions to a number of basic problems involving solvable and nilpotent permutation groups. Testing solvability is in NC, ...
Missing: Algorithms | Show results with:Algorithms
This work develops fast parallel solutions to a number of basic problems involving solvable and nilpotent permutation groups and exhibits a class of ...