University of Cambridge > > Isaac Newton Institute Seminar Series > Backtrack Search in Permutation Groups

Backtrack Search in Permutation Groups

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

GRAW02 - Computational and algorithmic methods

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]

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity