Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Nutan LimayeSrikanth SrinivasanSébastien TavenasPublished in: FOCS (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- high speed
- objective function
- depth information
- branch and bound
- depth map
- vc dimension
- lower and upper bounds
- quadratic assignment problem
- lower bounding
- polynomial approximation
- np hard
- cmos technology
- upper and lower bounds
- high levels
- stereo matching
- worst case
- special case