Backtrack Search in Permutation Groups
52 mins 9 secs,
166.67 MB,
WebM
640x360,
30.0 fps,
44100 Hz,
436.34 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Jefferson, C
Friday 31st January 2020 - 11:30 to 12:20 |
|---|
| Created: | 2020-01-31 13:48 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Jefferson, C |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | While there are many problems can be solved in polynomial time, some important fundamental problems can only be solved by backtrack searches, which are often exponential time. These include many important permutation group problems including group and coset intersection, stabilizer, normaliser, and canonical image problems.
This talk will give an overview of backtracking algorithms in permutation groups, explaining both the fundamental ideas, and the most improvements. In particular this will cover Leon's Partition Backtrack algorithm and the more recent Graph Backtracking algorithm. [This talk includes joint work with Rebecca Waldecker, Wilf Wilson and others] |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 756.91 MB | View | Download | |
| WebM * | 640x360 | 436.34 kbits/sec | 166.67 MB | View | Download | |
| iPod Video | 480x270 | 522.1 kbits/sec | 199.36 MB | View | Download | |
| MP3 | 44100 Hz | 249.8 kbits/sec | 95.47 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||