h1

h2

h3

h4

h5
h6
%0 Conference Paper
%A Lichter, Moritz
%A Raßmann, Simon
%A Schweitzer, Pascal
%T Computational Complexity of the Weisfeiler-Leman Dimension
%V 326
%C Saarbrücken/Wadern, Germany
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, February
%M RWTH-2025-01264
%B Leibniz International Proceedings in Informatics : LIPIcs
%P 13:1-13:22
%D 2025
%< 33rd EACSL Annual Conference on Computer Science Logic : CSL 2025, February 10-14, 2025, Amsterdam, Netherlands / edited by Jörg Endrullis, Sylvain Schmitz
%B 33. EACSL Annual Conference on Computer Science Logic
%C 10 Feb 2025 - 14 Feb 2025, Amsterdam (Netherlands)
Y2 10 Feb 2025 - 14 Feb 2025
M2 Amsterdam, Netherlands
%K Mathematics of computing → Graph algorithms (Other)
%K Theory of computation → Complexity theory and logic (Other)
%K Theory of computation → Problems, reductions and completeness (Other)
%K Weisfeiler-Leman algorithm (Other)
%K coherent configurations (Other)
%K complexity (Other)
%K dimension (Other)
%F PUB:(DE-HGF)7 ; PUB:(DE-HGF)8
%9 Contribution to a bookContribution to a conference proceedings
%R 10.4230/LIPIcs.CSL.2025.13
%U https://publications.rwth-aachen.de/record/1003905