Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps.
Christoph BerkholzJakob NordströmPublished in: CoRR (2016)
Keyphrases
- lower bound
- upper bound
- refinement process
- branch and bound algorithm
- branch and bound
- np hard
- worst case
- objective function
- lower and upper bounds
- optimal solution
- depth map
- lower bounding
- provably near optimal
- quadratic assignment problem
- depth information
- refinement step
- set of randomly generated instances
- multi step
- vc dimension
- concept class
- upper and lower bounds
- combinatorial optimization
- multi view
- similarity measure
- learning algorithm