Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
Nutan LimayeSrikanth SrinivasanSébastien TavenasPublished in: FOCS (2021)
Keyphrases
- lower bound
- upper bound
- np hard
- objective function
- branch and bound algorithm
- high levels
- lower and upper bounds
- optimal solution
- high speed
- upper and lower bounds
- knapsack problem
- algebraic structure
- branch and bound
- vc dimension
- three dimensional
- lower bounding
- randomly generated problems
- delay insensitive
- tunnel diode