"Resistant" Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas.
Maurice J. JansenKenneth W. ReganPublished in: COCOON (2007)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- depth map
- objective function
- np hard
- upper and lower bounds
- depth information
- lower and upper bounds
- branch and bound
- optimal solution
- lower bounding
- vc dimension
- worst case
- depth images
- multi view
- low order
- optimal cost
- linear programming relaxation
- randomly generated problems
- lagrange interpolation