|
Organizers |
Algorithmic problems in fully residually free groups
by
Olga Kharlampovich
McGill University
I will talk about different algorithmic problems that are decidable in fully residually free groups, in particular about the conjugacy problem.
Date received: February 20, 2002
Copyright © 2002 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caig-81.