Séminaire Lotharingien de Combinatoire, B14i (1986), 18 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1986, 323/S-14, p.
115-132.]
Reinhard Laue
Abbildungen und Algorithmen
Abstract.
The use of homomorphisms allows one in many cases to design effective
algorithms. Examples can be found in Algebra, particularly in Group
Theory, as well as in Computer Science. We show that under suitable
conditions we may obtain algorithms with logarithmic complexity.
To illustrate this assertion, we sketch several algorithms.
The following version is available: