Dempster's rule of combination is {\#}P-complete (Q2638783)

From MaRDI portal
Revision as of 19:45, 6 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    1990
    0 references
    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