Dempster's rule of combination is {\#}P-complete (Q2638783): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:23, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dempster's rule of combination is {\#}P-complete |
scientific article |
Statements
Dempster's rule of combination is {\#}P-complete (English)
0 references
1990
0 references
complexity of Dempster-Shafer computations
0 references
uncertain information
0 references
Dempster's rule of combination
0 references
Dempster-Shafer theory of evidence
0 references
