| W.M. Kantor and D.E. Taylor, Polynomial-time versions of Sylow'stheorem, J. Algorithms, to appear. |
....up into the hundred thousands. It is particularly interesting to note that some of these new methods for permutation groups, which have now become very practical, too, first were brought in through rather theoretical discussions of the complexity of permutation group algorithms. Neu86] Kan85] KT88] BLS88] BCF ar] BCFS91] BS92] to mention just a small selection of many papers on this subject. A broad variety of methods, many interactive, are available for working with representations and characters [NPP84] LP91] A long neglected, but now very rapidly growing branch of CGT are ....
W. Kantor and D. Taylor, Polynomial-time versions of Sylow's theorem, J. Algorithms 9 (1988), 1--17.
....the application to the graph isomorphism problem (ISO) for early work ( Ba1] FHL] Lu1] Mi1] Mi2] BL] used groups to put significant instances of ISO into polynomial time. Ensuing studies resulted in algorithms for deciphering the basic building blocks of the group ( BKL] Lu2] Ne] [KT], Ka1] Ka2] Ka3] BLS1] making available constructive versions of standard theoretical tools. One essential ingredient has, to a great extent, been lacking. The facility to deal with quotient groups (equivalently, homomorphic images of groups) is a central methodology of group theory, but ....
W.M. Kantor and D.E. Taylor, Polynomial-time versions of Sylow's theorem, J. Algorithms 9 (1988) 1--17.
No context found.
W.M. Kantor and D.E. Taylor, Polynomial-time versions of Sylow'stheorem, J. Algorithms, to appear.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC