Permutation group algorithms
Book information
Description
Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work 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. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.
Similar books
Permutation group algorithms
2002 · PDF
Cosmical Electrodynamics, 2nd Ed. (International Series of Monographs on Physics)
1963 · DJVU
Theory of Knowledge: An Introduction
1976 · DJVU
Introduction to Stochastic Processes with Special Reference to Methods and Applications
DJVU
Dynamical Theory of Crystal Lattices (The International series of monographs on physics)
1998 · DJVU
Communism and China: Ideology in Flux
1970 · DJVU
American Piety: The Nature of Religious Commitment (Patterns of Religious Commitment)
1970 · DJVU
Structural Linguistics (Midway Reprints)
1960 · DJVU