The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity. Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life.
"Sinopsis" puede pertenecer a otra edición de este libro.
Derek F. Holt, Bettina Eick, Eamonn A. O'Brien
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BennettBooksLtd, Los Angeles, CA, Estados Unidos de America
hardcover. Condición: New. In shrink wrap. Looks like an interesting title! Nº de ref. del artículo: Q-1584883723
Cantidad disponible: 1 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Hardcover. Condición: new. Hardcover. The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and with other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors' primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity. Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life. Covers the subject of computational group theory (CGT). This book describes the connections between the different aspects of CGT and other areas of computer algebra. It is suitable for graduate students who have some knowledge of group theory and computer algorithms. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781584883722
Cantidad disponible: 1 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. Covers the subject of computational group theory (CGT). This book describes the connections between the different aspects of CGT and other areas of computer algebra. It is suitable for graduate students who have some knowledge of group theory and computer algorithms. Series: Discrete Mathematics and its Applications. Num Pages: 536 pages, 6 black & white illustrations, 24 black & white tables. BIC Classification: PB. Category: (P) Professional & Vocational. Dimension: 234 x 162 x 35. Weight in Grams: 928. . 2005. 1st Edition. hardcover. . . . . Nº de ref. del artículo: V9781584883722
Cantidad disponible: 10 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Derek F. Holt, Bettina Eick, Eamonn A. O BrienThe origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today i. Nº de ref. del artículo: 230213292
Cantidad disponible: 1 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 2571952-n
Cantidad disponible: 10 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 2571952-n
Cantidad disponible: 10 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 2571952
Cantidad disponible: 10 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 2571952
Cantidad disponible: 10 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: New. Covers the subject of computational group theory (CGT). This book describes the connections between the different aspects of CGT and other areas of computer algebra. It is suitable for graduate students who have some knowledge of group theory and computer algorithms. Series: Discrete Mathematics and its Applications. Num Pages: 536 pages, 6 black & white illustrations, 24 black & white tables. BIC Classification: PB. Category: (P) Professional & Vocational. Dimension: 234 x 162 x 35. Weight in Grams: 928. . 2005. 1st Edition. hardcover. . . . . Books ship from the US and Ireland. Nº de ref. del artículo: V9781584883722
Cantidad disponible: 10 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 514 pages. 9.50x6.25x1.25 inches. In Stock. Nº de ref. del artículo: x-1584883723
Cantidad disponible: 1 disponibles