Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps.
Christoph BerkholzJakob NordströmPublished in: LICS (2016)
Keyphrases
- lower bound
- upper bound
- refinement process
- branch and bound
- branch and bound algorithm
- np hard
- optimal solution
- upper and lower bounds
- depth map
- polynomial approximation
- randomly generated problems
- objective function
- neural network
- depth images
- lower and upper bounds
- worst case
- multi step
- online algorithms
- lower bounding
- quantifier elimination
- data sets