Christopher Jefferson: „Theory and Practice in Computational Permutation Group Theory“
Termin |
Donnerstag, 20. Juni 2019, 16.15 - 18.00 Uhr |
---|---|
Veranstaltungsart | Kolloquium |
Reihe | Kolloquium des Instituts für Mathematik |
Einrichtung | Naturwissenschaftliche Fakultät II |
Veranstalter | Institut für Mathematik |
Veranstaltungsort | Informatikgebäude, Hörsaal 1.04 |
Straße | Von-Seckendorff-Platz 1 |
PLZ/Ort | 06120 Halle |
Ansprechpartner | Prof. Dr. Christiane Tammer |
---|---|
Telefon | +49 345-5524673 |
christiane.tammer@mathematik.uni-halle.de |
Beschreibung
There is a large body of research into proving complexity bounds for group theory problems, for example László Babai's proof that Graph Isomorphism can be solved in Quasi-Polynomial time.
However, how useful are such results in practice? In this talk I will discuss the practical implications of Babai's result, and also show some recent practical improvements in computational group theory which, while not improving worst-case complexity bounds of problems, allow us to solve much larger problems in practice.
Hinweise
Kolloquium des Instituts für Mathematik: https://www.mathematik.uni-halle.de/institut/kolloquium/