Unimodality, independence lead to NP-hardness of interval probability problems (Q877251): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 01:28, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Unimodality, independence lead to NP-hardness of interval probability problems |
scientific article |
Statements
Unimodality, independence lead to NP-hardness of interval probability problems (English)
0 references
19 April 2007
0 references
The authors consider probability distributions on the two-dimensional grid \(N^2\). The interval probability problem (IPP) is to check whether there exist a distribution which satisfy a given finite list of linear constraints (say, inequalities on functional moments). A set of additional constraints is considered, such as unimodality of the 2D distributions, unimodality of 1D conditional distributions, independence of entries, convexity of level sets. It is shown that adding any of these conditions to IPP turns it to a NP-hard problem.
0 references
moments
0 references
linear programming problem
0 references
linear constraints
0 references
interval probability problem
0 references
NP-hard problem
0 references