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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132996183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3759971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic-based analysis of Dempster-Shafer theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Dempster's rule for hierarchical evidence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 12:45, 21 June 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
    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

    Identifiers