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

DOI10.1007/S11155-006-9031-4zbMATH Open1120.65006OpenAlexW2049924785MaRDI QIDQ877251FDOQ877251

Authors: Daniel J. Berleant, Olga Kosheleva, Vladik Kreinovich, Hung T. Nguyen 

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

Recommendations

• scientific article; zbMATH DE number 3909744
• Simultaneous strong separations of probabilistic and unambiguous complexity classes
• On the unimodality of discrete probability measures
• On random hard sets for NP
• scientific article; zbMATH DE number 1555920
• Publication:4508376
• Unsatisfiability bounds for random CSPs from an energetic interpolation method
• On the stochastic independence properties of hard-core distributions
• Tight Probability Bounds with Pairwise Independence

zbMATH Keywords

momentslinear programming problemlinear constraintsNP-hard probleminterval probability problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Interval and finite arithmetic (65G30)

Cites Work

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

Cited In (2)

• Interval time series analysis with an application to the sterling-dollar exchange rate
• Computing best-possible bounds for the distribution of a sum of several variables is NP-hard

Uses Software

• Statool

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877251)