3 Review(s)

Since its origin in the early 20th century, combinatorial group theory has been primarily concerned with algorithms for solving particular problems on groups given by generators and relations: word problems, conjugacy problems, isomorphism problems, etc. Recent years have seen the focus of algorithmic group theory shift from the decidability/undecidability type of result to the complexity of algorithms. Papers in this volume reflect that paradigm shift. Articles are based on the AMS/ASL Joint Special Session, Interactions Between Logic, Group Theory and Computer Science. The volume is suitable for graduate students and research mathematicians interested in computational problems of group theory.