Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps

Christoph Berkholz, Jakob Nordström. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. Electronic Colloquium on Computational Complexity (ECCC), 23:135, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.