Book contents
- Frontmatter
- 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
9 - Backtrack Methods
Published online by Cambridge University Press: 15 August 2009
- Frontmatter
- 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
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9780511546549/resource/name/firstPage-9780511546549c9_p201-217_CBO.jpg)
- Type
- Chapter
- Information
- Permutation Group Algorithms , pp. 201 - 217Publisher: Cambridge University PressPrint publication year: 2003