Polynomial-time normalizers for permutation groups with restricted composition factors

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 176-183

  Luks, Eugene M ^a   Miyazaki, Takunari ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; VECTORS;

PERMUTATION GROUPS; POLYNOMIAL TIME NORMLIZERS; RESTRICTED COMPOSITION FACTORS;

POLYNOMIALS;

EID: 0036046084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780529     Document Type: Conference Paper

References (31)

1. On the maximal subgroups of the finite classical groups
2. On the orders of primitive groups with restricted nonabelian composition factors
3. Computational complexity and the classification of finite simple groups
4. Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes
5. An introduction to algebraic programming in Magma
6. Polynomial-time algorithms for permutation groups
7. Computing intersections and normalizers in soluble groups
8. Testing matrix groups for primitivity
9. Sylow's theorem in polynomial time
10. Finding Sylow normalizers in polynomial time
11. Computing in quotient groups
12. The computational matrix group project
13. Partitions, refinements, and permutation group computation
14. Isomorphism of graphs of bounded valence can be tested in polynomial time
15. Computing the composition factors of a permutation group in polynomial time
16. Computing in solvable matrix groups
17. Permutation groups and polynomial-time computation
18. Computing normalizers in permutation p-groups
19. Some algorithms for nilpotent permutation groups
20. Isomorphism of k-contractible graphs, a generalization of bounded valence and bounded genus
21. Polynomial-time computation in matrix groups
22. Aymptotic results for permutation groups
23. Computing the structure of finite algebras
24. Graph isomorphism is in the low hierachy
25. Representations in characteristic p
26. Computational methods in the study of permutation groups
27. Matrix groups
28. Eine methode zur normalisatorberechnung in permutationsgruppen mit anwendungen in der konstruktion primitiver gruppen