Polynomial-time theory of matrix groups
Proceedings of the forty-first annual ACM symposium on Theory of computing
Biased tadpoles: a fast algorithm for centralizers in large matrix groups
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computing polycyclic presentations for polycyclic rational matrix groups
Journal of Symbolic Computation
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 0.00 |
The author announces methods for efficient management of solvable matrix groups over finite fields. He shows that solvability and nilpotence can be tested in polynomial-time. Such efficiency seems unlikely for membership-testing, which subsumes the discrete-log problem. However, assuming that the primes in mod G mod (other than the field characteristic) are polynomially-bounded, membership-testing and many other computational problems are in polynomial time. These problems include finding stabilizers of vectors and of subspaces and finding centralizers and intersections of subgroups. An application to solvable permutation groups puts the problem of finding normalizers of subgroups into polynomial time. Some of the results carry over directly to finite matrix groups over algebraic number fields; thus, testing solvability is in polynomial time, as is testing membership and finding Sylow subgroups.