1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DM2024★ 1 cited
Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables…
cs.LO2023
Simulating Logspace-Recursion with Logarithmic Quantifier Depth
Steffen van Bergerem, Martin Grohe, Sandra Kiefer +1
The fixed-point logic LREC= was developed by Grohe et al. (CSL 2011) in the quest for a logic to capture all problems decidable in logarithmic space. It extends FO+C, first-order l…