Geodesic
Abbildungen und Algorithmen
Séminaire lotharingien de combinatoire, Tome 14 (1986) 
Reinhard Laue. Abbildungen und Algorithmen. Séminaire lotharingien de combinatoire, Tome 14 (1986). http://geodesic.mathdoc.fr/item/SLC_1986_14_a8/
@article{SLC_1986_14_a8,
     author = {Reinhard Laue},
     title = {Abbildungen und {Algorithmen}},
     journal = {S\'eminaire lotharingien de combinatoire},
     year = {1986},
     volume = {14},
     url = {http://geodesic.mathdoc.fr/item/SLC_1986_14_a8/}
}
TY  - JOUR
AU  - Reinhard Laue
TI  - Abbildungen und Algorithmen
JO  - Séminaire lotharingien de combinatoire
PY  - 1986
VL  - 14
UR  - http://geodesic.mathdoc.fr/item/SLC_1986_14_a8/
ID  - SLC_1986_14_a8
ER  - 
%0 Journal Article
%A Reinhard Laue
%T Abbildungen und Algorithmen
%J Séminaire lotharingien de combinatoire
%D 1986
%V 14
%U http://geodesic.mathdoc.fr/item/SLC_1986_14_a8/
%F SLC_1986_14_a8

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

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: