Estimating information amount under uncertainty: algorithmic solvability and computational complexity

DOI10.1080/03081071003696025zbMath1195.94042OpenAlexW1993988737MaRDI QIDQ3577034

Gang Xiang, Vladik Ya. Kreinovich

Publication date: 3 August 2010

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081071003696025

zbMATH Keywords

entropyuncertaintycomputational complexityinterval uncertaintyprobabilistic uncertaintyamount of information

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information theory (general) (94A15)

Related Items (1)

Interval or moments: which carry more information?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum entropy approach to fuzzy control
• Maximum entropy and interval computations (September notes on summer impressions)
• Uncertainty-based information. Elements of generalized information theory.
• Computing population variance and entropy under interval uncertainty: Linear-time algorithms
• Uncertainty and Information
• A NON-SPECIFICITY MEASURE FOR CONVEX SETS OF PROBABILITY DISTRIBUTIONS
• Probability Theory
• AN ALGORITHM TO COMPUTE THE UPPER ENTROPY FOR ORDER-2 CAPACITIES
• MAXIMUM OF ENTROPY FOR CREDAL SETS
• Difference of entropies as a non-specificity function on credal sets†

This page was built for publication: Estimating information amount under uncertainty: algorithmic solvability and computational complexity