Pascal Schweitzer, Recent insights surrounding combinatorial approaches to isomorphism and symmetry problems
Room B332 IBS (기초과학연구원)Modern practical software libraries that are designed for isomorphism tests and symmetry computation rely on combinatorial techniques combined with techniques from algorithmic group theory. The Weisfeiler-Leman algorithm is such a combinatorial technique. When taking a certain view from descriptive complexity theory, the algorithm is universal. After an introduction to problems arising in symmetry computation and …