Lower Bounds on Interactive Compressibility by Constant-Depth Circuits.
Arkadev ChattopadhyayRahul SanthanamPublished in: FOCS (2012)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- computer graphics
- np hard
- high speed
- depth map
- branch and bound
- user friendly
- optimal solution
- worst case
- constant factor
- computer vision
- upper and lower bounds
- vc dimension
- depth information
- user interaction
- three dimensional
- high quality
- circuit design
- quadratic assignment problem
- lower bounding