Unimodality, independence lead to NP-hardness of interval probability problems

DOI10.1007/s11155-006-9031-4zbMath1120.65006OpenAlexW2049924785MaRDI QIDQ877251

O. M. Kosheleva, Daniel J. Berleant, Nguyen Trung Hung, Vladik Ya. Kreinovich

Publication date: 19 April 2007

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1167&context=cs_techrep

zbMATH Keywords

momentslinear constraintsNP-hard problemlinear programming probleminterval probability problem

Mathematics Subject Classification ID

Related Items (1)

Interval time series analysis with an application to the sterling-dollar exchange rate

Uses Software

• Statool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ranges of posterior measures for priors with unimodal contaminations
• On the use of capacities in modeling uncertainty aversion and risk aversion
• Computational complexity and feasibility of data processing and interval computations
• Dependable handling of uncertainty
• Computation of bounds on population parameters when the data are incomplete
• Using Pearson correlation to improve envelopes around the distributions of functions
• Statool: A tool for distribution envelope determination (DEnv), an interval-based algorithm for arithmetic on random variables
• Partial identification of probability distributions.
• A feasible algorithm for locating concave and convex zones of interval data and its use in statistics-based clustering
• Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
• Jeffrey's conditioning rule in neighbourhood models

This page was built for publication: Unimodality, independence lead to NP-hardness of interval probability problems