# Heuristics for the Whitehead minimization problem.

Haralick, R.M.; Miasnikov, A.D.; Myasnikov, A.G.

Experimental Mathematics (2005)

- Volume: 14, Issue: 1, page 7-14
- ISSN: 1058-6458

## Access Full Article

top## How to cite

topHaralick, R.M., Miasnikov, A.D., and Myasnikov, A.G.. "Heuristics for the Whitehead minimization problem.." Experimental Mathematics 14.1 (2005): 7-14. <http://eudml.org/doc/53072>.

@article{Haralick2005,

author = {Haralick, R.M., Miasnikov, A.D., Myasnikov, A.G.},

journal = {Experimental Mathematics},

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},

language = {eng},

number = {1},

pages = {7-14},

publisher = {Taylor & Francis, Philadelphia},

title = {Heuristics for the Whitehead minimization problem.},

url = {http://eudml.org/doc/53072},

volume = {14},

year = {2005},

}

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

PB - Taylor & Francis, Philadelphia

VL - 14

IS - 1

SP - 7

EP - 14

LA - eng

KW - 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

UR - http://eudml.org/doc/53072

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.