48 search results - page 1 / 10 » The complexity of central series in nilpotent computable gro... |
APAL
2011
12 years 11 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
IJAC
2008
13 years 4 months ago
2008
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
FOCS
1992
IEEE
13 years 8 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 ...
SSDBM
1994
IEEE
13 years 8 months ago
1994
IEEE
The analysis of time series is a central issue in economic research and many other scientific applications. However, the data management functionality for this field is not provid...
BICOB
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we investigate the structure and representation of n-ary algebras arising from DNA recombination, where n is a number of DNA segments participating in recombination. ...