Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles.
Dmitry ItsyksonVsevolod OparinMikhail SlabodkinDmitry SokolovPublished in: Fundam. Informaticae (2016)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity measures
- average case complexity
- branch and bound algorithm
- np hard
- branch and bound
- matching algorithm
- matching process
- objective function
- optimal solution
- lower and upper bounds
- vc dimension
- graph matching
- pattern matching
- randomly generated problems
- optimal cost
- upper and lower bounds
- computational complexity
- high resolution
- low resolution
- linear programming
- space complexity
- decision problems
- image matching
- np complete
- max sat
- lower bounding
- keypoints
- sample size
- multiscale