Login / Signup
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps.
Christoph Berkholz
Jakob Nordström
Published in:
Electron. Colloquium Comput. Complex. (2016)
Keyphrases
</>
lower bound
upper bound
refinement process
upper and lower bounds
lower and upper bounds
branch and bound algorithm
depth information
refinement step
lower bounding
branch and bound
vc dimension
depth map
optimal solution
objective function
neural network
np hard
query processing
learning algorithm