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]
@article{BerkholzN16-0,
title = {Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps},
author = {Christoph Berkholz and Jakob Nordström},
year = {2016},
url = {http://eccc.hpi-web.de/report/2016/135},
researchr = {https://researchr.org/publication/BerkholzN16-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {23},
pages = {135},
}