Strachey Lecture: Symmetry and Similarity

An introduction to algorithmic aspects of symmetry and similarity, ranging from the fundamental complexity theoretic "Graph Isomorphism Problem" to applications in optimisation and machine learning Symmetry is a fundamental concept in mathematics, science and engineering, and beyond. Understanding symmetries is often crucial for understanding structures. In computer science, we are mainly interested in the symmetries of combinatorial structures. Computing the symmetries of such a structure is essentially the same as deciding whether two structures are the same ("isomorphic"). Algorithmically, this is a difficult task that has received a lot of attention since the early days of computing. It is a major open problem in theoretical computer science to determine the precise computational complexity of this "Graph Isomorphism Problem".

You can listen to Strachey Lecture: Symmetry and Similarity online on Radio and Podcast. Open the player on this page to stream the available audio.

Strachey Lecture: Symmetry and Similarity is an episode from Computer Science by Oxford University.

This episode is 60:34 long.

This episode was published on Feb 16, 2023.

Yes. Use the heart button on the episode page to add it to your favorite episodes list.

Yes. This page shows related episodes from Computer Science when more episodes are available from the podcast feed.