Guest Column: Lower Bounds Against Constant-Depth Algebraic Circuits.
Nutan LimayeSrikanth SrinivasanSébastien TavenasPublished in: SIGACT News (2022)
Keyphrases
- lower bound
- upper bound
- objective function
- constant factor
- lower and upper bounds
- high speed
- branch and bound algorithm
- virtual machine
- depth information
- depth map
- branch and bound
- delay insensitive
- vc dimension
- data structure
- np hard
- optimal solution
- logic synthesis
- neural network
- multi view
- depth images
- linear programming
- circuit design
- quadratic assignment problem