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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:3dc35106e868 · see in the full table