Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps.
Christoph BerkholzJakob NordströmPublished in: J. ACM (2023)
Keyphrases
- lower bound
- upper bound
- refinement process
- upper and lower bounds
- np hard
- depth information
- refinement step
- lower and upper bounds
- depth map
- set of randomly generated instances
- input image
- special case
- lower bounding
- optimal cost
- randomly generated problems
- objective function
- neural network
- rough sets
- vc dimension
- high resolution
- quadratic assignment problem
- optimal solution