Permutation group algorithms based on partitions, I: Theory and algorithms
- 1 October 1991
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 12 (4-5) , 533-583
- https://doi.org/10.1016/s0747-7171(08)80103-4
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- A General backtrack algorithm for the isomorphism problem of combinatorial objectsJournal of Symbolic Computation, 1985
- Computing normalizers in permutation groupsJournal of Algorithms, 1983
- Computing in Permutation and Matrix Groups II: Backtrack AlgorithmMathematics of Computation, 1982
- Computing automorphism groups of error-correcting codesIEEE Transactions on Information Theory, 1982
- Finding the order of a permutation groupProceedings of Symposia in Pure Mathematics, 1981
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating PermutationsMathematics of Computation, 1980
- On an algorithm for finding a base and a strong generating set for a group given by generating permutationsMathematics of Computation, 1980
- Some group-theoretic algorithmsLecture Notes in Mathematics, 1978
- Computing automorphisms and canonical labellings of graphsLecture Notes in Mathematics, 1978