A better-than-3logn depth lower bound for De Morgan formulas with restrictions on top gates.
Ivan MihajlinAnastasia SofronovaPublished in: Electron. Colloquium Comput. Complex. (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- upper and lower bounds
- worst case
- optimal solution
- lower and upper bounds
- lower bounding
- objective function
- depth map
- np hard
- linear programming relaxation
- linear programming
- depth information
- sample complexity
- special case
- high quality
- competitive ratio
- polynomial approximation
- sufficiently accurate