1 citations · 1 across the 3 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.LO2024
Finite Variable Counting Logics with Restricted Requantification
Simon Raßmann, Georg Schindling, Pascal Schweitzer
Counting logics with a bounded number of variables form one of the central concepts in descriptive complexity theory. Although they restrict the number of variables that a formula…
cs.DM2024★ 1 cited
An Upper Bound on the Weisfeiler-Leman Dimension
Thomas Schneider, Pascal Schweitzer
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory a…
cs.CC2024
Computational complexity of the Weisfeiler-Leman dimension
Moritz Lichter, Simon Raßmann, Pascal Schweitzer
The Weisfeiler-Leman dimension of a graph is the least number such that the -dimensional Weisfeiler-Leman algorithm distinguishes from every other non-isomorphic gra…