Permutation Group Algorithms

Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout.

Zusammenfassung
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.

Inhalt
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.

#	Onlineshop	Preis CHF	Versand CHF	Total CHF
1	Seller	0.00	0.00	0.00