Parallel algorithms for solvable permutation groups
- 1 August 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (1) , 39-62
- https://doi.org/10.1016/0022-0000(88)90044-x
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An O ( n 3 log n ) deterministic and an O ( n 3 ) Las Vegs isomorphism test for trivalent graphsJournal of the ACM, 1987
- Polynomial-time algorithms for finding elements of prime order and sylow subgroupsJournal of Algorithms, 1985
- Sylow's theorem in polynomial timeJournal of Computer and System Sciences, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On the complexity of intersection and conjugacy problems in free groupsTheoretical Computer Science, 1984
- The Nielsen reduction and P-complete problems in free groupsTheoretical Computer Science, 1984
- On the orders of primitive groups with restricted nonabelian composition factorsJournal of Algebra, 1982
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- An algorithm for finding the blocks of a permutation groupMathematics of Computation, 1975