Published October 7, 2026
| Version v1
Preprint
Open
Lower Bounds for Weisfeiler-Leman
Authors/Creators
- 1. IT University of Copenhagen and Basic Algorithms Research Copenhagen
-
2.
Shanghai Jiao Tong University
-
3.
Max Planck Institute for Informatics
-
4.
RWTH Aachen University
-
5.
IT University of Copenhagen
Description
We show a range of hardness results for the Weisfeiler--Leman algorithm.
Files
Compiling_to_WL.pdf
Additional details
Dates
- Created
-
2026-10-07