ACM/IEEE Logic in Computer Science, LICS 2016


Article Details
Title: Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps
Article URLs:
Alternative Article URLs:
Authors: Christoph Berkholz
  • Humboldt-Universität zu Berlin
Jakob Nordström
  • KTH Royal Institute of Technology
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/lics/BerkholzN16
Author Comments:

Discuss this paper and its artifacts below