Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site faron.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxt!houxm!whuxl!whuxlm!harpo!decvax!linus!faron!bs
From: bs@faron.UUCP (Robert D. Silverman)
Newsgroups: net.math
Subject: Non-Abelian Finite Groups
Message-ID: <259@faron.UUCP>
Date: Sun, 24-Mar-85 12:53:13 EST
Article-I.D.: faron.259
Posted: Sun Mar 24 12:53:13 1985
Date-Received: Thu, 28-Mar-85 01:05:25 EST
Distribution: net
Organization: The MITRE Coporation, Bedford, MA
Lines: 9


Given: The multiplication table for a non-Abelian finite group.
Assume that the order of the group is N, a non-prime. Does anyone
know of an algorithm that will systematically pull out ALL of the
possible sub-groups and yield their multiplication tables? If so
what is the complexity of such an algorithm?


*** REPLACE THIS LINE WITH YOUR MESSAGE ***