Updating Credal Networks is Approximable in Polynomial Time

Keyphrases

• Polynomial Time 100%
• Credal Networks 100%
• Number of States 25%
• Expressiveness 25%
• Bayesian Network 25%
• Approximation Algorithms 25%
• Closed Convex Sets 25%
• State-of-the-art Techniques 25%
• Approximation Scheme 25%
• FPTAS 25%
• Bounded Treewidth 25%
• Uncertainty Representation 25%
• Posterior Inference 25%
• Error Factors 25%
• Sets of Probability Measures 25%
• Precise Probability 25%
• Variable Elimination Algorithm 25%
• Input Size 25%
• High Computational Cost 25%
• Time Polynomial 25%

Computer Science

• Polynomial Time 100%
• Bayesian Networks 50%
• Approximation Algorithms 50%
• Fully Polynomial-Time Approximation Scheme 50%
• Variable Elimination 50%
• approximation scheme 50%
• Probability 50%
• Computational Cost 50%
• Good Approximation 50%
• Probability Measure 50%

Mathematics

• Credal Network 100%
• Polynomial Time 100%
• Bayesian Network 25%
• Probability Measure 25%
• Closed Convex Set 25%
• Computational Cost 25%
• Bounded Number 25%
• Expressiveness 25%
• Good Approximation 25%
• Fully Polynomial-Time Approximation Scheme 25%
• Probability 25%