Computing automorphisms of finite soluble groups
There is a large collection of effective algorithms for computing information about finite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an effective algorithm for computing the automorphism group of a finite soluble group. An algorithm designed for finite groups in general provides...[Show more]
|Collections||Open Access Theses|
|b19051244_Smith_Michael_J.pdf||8.04 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.