𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm for constructing the basis of a subgroup of a free group

✍ Scribed by A. A. Letichevskii; A. B. Godlevskii; S. L. Krivoi

Publisher
Springer US
Year
1982
Tongue
English
Weight
1022 KB
Volume
17
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Algorithm for the Construction of a N
An Algorithm for the Construction of a Normal Basis
✍ Kurt Girstmair πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 117 KB

We present an algorithm for the construction of a normal basis of a Galois extension of degree n in characteristic 0. The algorithm requires O(n 4 ) multiplications in the ground field. It is based on representation theory but does not require the knowledge of representation theoretical data (like c

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced GrΓΆbner Basis of Binomial Ideals
✍ Ulla Koppenhagen; Ernst W. Mayr πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 642 KB

In this paper, we present an optimal, exponential space algorithm for generating the reduced GrΓΆbner basis of binomial ideals. We make use of the close relationship between commutative semigroups and pure difference binomial ideals. Based on an optimal algorithm for the uniform word problem in commu