Computing the partition function for perfect matchings in a hypergraph

Keyphrases

• Partition Function 100%
• Hypergraph 100%
• K-subsets 100%
• Perfect Matching 100%
• Disjoint 50%
• Element Set 50%
• Simple Polynomials 50%
• Polynomial-time Algorithm 50%
• Non-negative Weight 50%
• Hypergraph Matching 50%
• Bregman 50%
• MinC 50%
• Van Der Waerden 50%

Mathematics

• Hypergraphs 100%
• Partition Function 100%
• Partition Coefficient 100%
• Perfect Matchings 100%
• Approximates 50%
• Polynomial 50%
• Polynomial Time 50%
• Constant Factor 50%
• Element Set 50%
• Pairwise Disjoint 50%