Geodesic
Heuristics for the Whitehead minimization problem.
Experimental mathematics, Tome 14 (2005) no. 1, pp. 7-14 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Keywords: free groups, automorphism problem, Whitehead method, probabilistic algorithms, automorphic orbits, elements of minimal length, free generating sets, reduced words, minimization problem, heuristic algorithms, Whitehead algorithm 
@article{EXMA_2005__14_1_53072,
     author = {Haralick, R.M. and Miasnikov, A.D. and Myasnikov, A.G.},
     title = {Heuristics for the {Whitehead} minimization problem.},
     journal = {Experimental mathematics},
     pages = {7--14},
     year = {2005},
     volume = {14},
     number = {1},
     zbl = {1109.20021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/EXMA_2005__14_1_53072/}
}
TY  - JOUR
AU  - Haralick, R.M.
AU  - Miasnikov, A.D.
AU  - Myasnikov, A.G.
TI  - Heuristics for the Whitehead minimization problem.
JO  - Experimental mathematics
PY  - 2005
SP  - 7
EP  - 14
VL  - 14
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/EXMA_2005__14_1_53072/
LA  - en
ID  - EXMA_2005__14_1_53072
ER  - 
%0 Journal Article
%A Haralick, R.M.
%A Miasnikov, A.D.
%A Myasnikov, A.G.
%T Heuristics for the Whitehead minimization problem.
%J Experimental mathematics
%D 2005
%P 7-14
%V 14
%N 1
%U http://geodesic.mathdoc.fr/item/EXMA_2005__14_1_53072/
%G en
%F EXMA_2005__14_1_53072
Haralick, R.M.; Miasnikov, A.D.; Myasnikov, A.G. Heuristics for the Whitehead minimization problem.. Experimental mathematics, Tome 14 (2005) no. 1, pp. 7-14. http://geodesic.mathdoc.fr/item/EXMA_2005__14_1_53072/