Top-Down Lower Bounds for Depth-Four Circuits.
Mika GöösArtur RiazanovAnastasia SofronovaDmitry SokolovPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- optimal solution
- high speed
- upper and lower bounds
- lower bounding
- worst case
- np hard
- quadratic assignment problem
- vc dimension
- delay insensitive
- min sum
- optimal cost
- boolean functions
- analog circuits
- depth information
- digital circuits
- linear programming relaxation
- logic circuits
- depth map
- scheduling problem
- analog vlsi