Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Susanna F. de RezendeJakob NordströmKilian RisseDmitry SokolovPublished in: Computational Complexity Conference (2020)
Keyphrases
- lower bound
- graph matching
- upper bound
- matching algorithm
- maximum cardinality
- objective function
- pattern matching
- branch and bound
- matching process
- subgraph isomorphism
- np hard
- average case complexity
- attributed relational graph
- gaussian graphical models
- association graph
- lower bounding
- bipartite graph
- worst case
- lower and upper bounds
- graph databases
- high dimensional
- face recognition
- learning algorithm