Approximation Complexity of Maximum A Posteriori Inference in Sum-Product Networks

Keyphrases

• Min-max Algorithm 100%
• Approximation Complexity 100%
• Sum-product Networks 100%
• NP-hard 50%
• Tight 50%
• NP-hardness 50%
• Tight Bounds 50%
• SIMPLE Algorithm 50%
• Non-approximability 50%
• Computational Complexity 50%
• Maximum Independent Set 50%
• Sublinear Function 50%
• Maximum a Posteriori Inference 50%
• Linear Factor 50%
• Max-product 50%
• Network Approximation 50%

Mathematics

• Posteriori 100%
• Product Sum 100%
• Approximates 50%
• Real-World Data 50%
• Linear Factor 50%
• Maximum Independent Set 50%
• Approximability 50%

Computer Science

• Approximation (Algorithm) 100%
• Product Algorithm 66%
• Computational Complexity 33%
• Simple Algorithm 33%
• Independent Set 33%