Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Susanna F. de RezendeJakob NordströmKilian RisseDmitry SokolovPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- lower bound
- graph matching
- upper bound
- matching algorithm
- maximum cardinality
- subgraph isomorphism
- high dimensional
- branch and bound algorithm
- high resolution
- average case complexity
- matching process
- graph partitioning
- image matching
- branch and bound
- objective function
- association graph
- optimal solution
- vc dimension
- keypoints
- pattern matching
- shape matching
- edit distance
- graph theory
- sparse coding
- first order logic
- lower bounding
- sparse representation
- logical formulas
- feature points
- object recognition