Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth.
Andreas KrebsOleg VerbitskyPublished in: LICS (2015)
Keyphrases
- lower bound
- upper bound
- color images
- multi valued
- color information
- single shot
- branch and bound
- lower and upper bounds
- branch and bound algorithm
- color space
- color constancy
- objective function
- modal logic
- depth information
- np hard
- color features
- upper and lower bounds
- depth map
- video sequences
- online algorithms
- worst case
- data structure
- classical logic
- color correction
- concept class
- key topics
- optimal solution