Unimodality, independence lead to NP-hardness of interval probability problems
From MaRDI portal
(Redirected from Publication:877251)
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
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 804633 (Why is no real title available?)
- A feasible algorithm for locating concave and convex zones of interval data and its use in statistics-based clustering
- Computation of bounds on population parameters when the data are incomplete
- Computational complexity and feasibility of data processing and interval computations
- Computing best-possible bounds for the distribution of a sum of several variables is NP-hard
- Dependable handling of uncertainty
- Jeffrey's conditioning rule in neighbourhood models
- On the use of capacities in modeling uncertainty aversion and risk aversion
- Partial identification of probability distributions.
- Ranges of posterior measures for priors with unimodal contaminations
- Statool: A tool for distribution envelope determination (DEnv), an interval-based algorithm for arithmetic on random variables
- Using Pearson correlation to improve envelopes around the distributions of functions
Cited in
(2)
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)
