It is a comprehensive text presenting the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously finite, and describing methods for working with elements, subgroups and quotient groups of a finitely presented group.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas:
"this book is a very interesting treatment of the computational aspects of combinatorial group theory. It is well-written, nicely illustrating the algorithms presented with many examples. Also, some remarks on the history of the field are included. In adition, many exercises are provided throughout...this is a very valuable book that is well-suited as a textbook for a graduate course on computational group theory. It addresses students of mahtematics and of computer science alike, providing the necessary background for both. In addition, this book will be of good use as a reference source for computational aspects of combinatorial group theory." Friedrich Otto, Mathematical Reviews
Product Description:
Book by Sims Charles C
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagCambridge University Press
- Erscheinungsdatum1994
- ISBN 10 0521432138
- ISBN 13 9780521432139
- EinbandTapa dura
- Anzahl der Seiten624