151 search results - page 1 / 31 » Computing in Solvable Matrix Groups |
FOCS
1992
IEEE
13 years 9 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
ICTCS
2005
Springer
13 years 10 months ago
2005
Springer
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
MOC
2000
13 years 5 months ago
2000
The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable n...
ICMS
2010
13 years 3 months ago
2010
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...