Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps¶
Berkholz, C., & Nordström, J. (2023). Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps. Journal of the ACM, 70(5).
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Quantifier Rank
- Finite-variable logics study a separate resource—the number of available variables—alongside rank; contemporary lower-bound work explicitly investigates their tradeoff.
This sourceTreats quantifier depth/rank and number of variables as distinct resources and relates depth lower bounds to finite-variable logic and refinement iterations.
- Finite-variable logics study a separate resource—the number of available variables—alongside rank; contemporary lower-bound work explicitly investigates their tradeoff.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:3dc35106e868 · see in the full table