Polynomial-time perfect matchings in dense hypergraphs.
Peter KeevashFiachra KnoxRichard MycroftPublished in: STOC (2013)
Keyphrases
- special case
- hypertree decomposition
- approximation algorithms
- stereo correspondence
- computational complexity
- graph theory
- worst case
- machine learning
- np hardness
- bounded treewidth
- dnf formulas
- optical flow fields
- information systems
- computer vision
- learning algorithm
- database
- uniform distribution
- arbitrary shape
- decomposition methods
- neural network