We develop fast parallel solutions to a number of basic problems involving solvable and nilpotent permutation groups. Testing solvability is in NC, ...
We develop fast parallel solutions to a number of basic problems involving solvable and nilpotent permutation groups. Testing solvability is in NC, ...
We present several new fast parallel algorithms for dealing with permutation groups, a.long with implications for graph isomorphism. Until now little was known.
A number of basic problems involving solvable and nilpotent permutation groups are shown to have fast parallel solutions.
Abstract. We study the problem of generating random permutations, i.e., of drawing random elements from the uniform distribution over the set of all ...
Jun 18, 2018 · This article introduces an algorithm, MergeShuffle, which is an ex- tremely efficient algorithm to generate random permutations (or to.
We compare parallel algorithms for random per- mutation generation on symmetric multiprocessors. (SMPs). Algorithms considered are the sorting-based.
However, one's ability to find fast parallel solutions to linear algebra questions depends on alternate, and elegant, methods for computing determinants (e.g., ...
On parallel generation of partial derangements, derangements and permutations. PPAM'07: Proceedings of the 7th international conference on Parallel processing ...
Missing: Groups | Show results with:Groups
A number of basic problems involving solvable and nilpotent permutation groups are shown to have fast parallel solutions. Testing solvability is in NC as ...