Theoretical computer science · Oct 6, 2026
The computational complexity of Weisfeiler–Leman refinement
Proves unconditional deterministic time lower bounds for joint and separate k-dimensional Weisfeiler–Leman equivalence, for sufficiently large fixed k in the specified sequential adjacency-matrix models. With dimension as input, joint equivalence is EXPTIME-complete even on subcubic graphs; deciding whether refinement identifies a graph is also EXPTIME-complete.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model