BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Backtrack Search in Permutation Groups - Christopher Jefferson (Un
 iversity of St Andrews)
DTSTART:20200131T113000Z
DTEND:20200131T122000Z
UID:TALK138307@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:While there are many problems can be solved in polynomial time
 \, some important fundamental problems can only be solved by backtrack sea
 rches\, which are often exponential time. These include many important per
 mutation group problems including group and coset intersection\, stabilize
 r\, normaliser\, and canonical image problems.  &nbsp\;  <br><br>This talk
  will give an overview of backtracking algorithms in permutation groups\, 
 explaining both the fundamental ideas\, and the most improvements. In part
 icular this will cover Leon&#39\;s Partition Backtrack algorithm and the m
 ore recent Graph Backtracking algorithm.  &nbsp\;  <br><br>[This talk incl
 udes joint work with Rebecca Waldecker\, Wilf Wilson and others]
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR
