Divide-and-conquer in computational group theory

Authors:
Greg Butler
Affiliations:
Univ. of Sydney, Sydney, Australia
Venue:
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Year:
1986

Citing 3
Cited 0

Effective computation with group homomorphisms

Journal of Symbolic Computation
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
An algorithm for the computation of conjugacy classes and centralizes in p-groups

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paradigm of divide-and-conquer appears in five guises in computational group theory: Subgroup Restriction, Subgroup Lifting, Extension, Normal Lifting, and Homomorphic Lifting. The building blocks for these strategies are algorithms for subgroup construction, coset enumeration, and homomorphisms.