Limit search to available items
Book Cover
E-book
Author Seress, kos

Title Permutation Group Algorithms / kos Seress
Published Cambridge : Cambridge University Press, 2003

Copies

Description 1 online resource (274 pages)
Series Cambridge Tracts in Mathematics ; no. 152
Cambridge tracts in mathematics ; no. 152.
Contents Cover; Half-title; Title; Copyright; Contents; 1 Introduction; 2 Black-Box Groups; 3 Permutation Groups A Complexity Overview; 4 Bases and Strong Generating Sets; 5 Further Low-Level Algorithms; 6 A Library of Nearly Linear-Time Algorithms; 7 Solvable Permutation Groups; 8 Strong Generating Tests; 9 Backtrack Methods; 10 Large-Base Groups; Bibliography; Index
Summary Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, up to the most recent developments, 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
Notes English
Subject Permutation groups.
Algorithms.
Algorithms
algorithms.
Algorithms
Permutation groups
Permutationsgruppe
Computeralgebra
Form Electronic book
Author Cambridge University Press.
ISBN 9780511546549
0511546548
0511068603
9780511068607
OTHER TI Cambridge books online