9780521661034 - Permutation Group Algorithms: 152 (Cambridge Tracts in Mathematics, Series Number 152) de Seress, Akos; Seress, Kos (20 resultados)

23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 SER 9780521661034 Sprache: Englisch Gewicht in Gramm: 550.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 SER 9780521661034 Sprache: Englisch Gewicht in Gramm: 550.

Condición: New.

Condición: New.

Condición: New. In.

Condición: New.

Condición: New. Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Series: Cambridge Tracts in Mathematics. Num Pages: 274 pages, 30 b/w illus. BIC Classification: PBG. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 19. Weight in Grams: 529. . 2003. Illustrated. hardcover. . . . .

Condición: New. Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Series: Cambridge Tracts in Mathematics. Num Pages: 274 pages, 30 b/w illus. BIC Classification: PBG. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 19. Weight in Grams: 529. . 2003. Illustrated. hardcover. . . . . Books ship from the US and Ireland.

Hardcover. Condición: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: new. Hardcover. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Condición: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand.

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Hardcover. Condición: new. Hardcover. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and.

Hardcover. Condición: new. Hardcover. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.