Approximating cost-based abduction is NP-hard (Q814635)

From MaRDI portal
Revision as of 23:16, 5 July 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
Approximating cost-based abduction is NP-hard
scientific article

    Statements

    title
    Approximating cost-based abduction is NP-hard (English)
    0 references
    author
    Ashraf M. Abdelbar
    0 references
    publication date
    7 February 2006
    0 references
    zbMATH Keywords
    Explanation
    0 references
    Complexity
    0 references
    Uncertainty
    0 references
    Belief revision
    0 references
    Diagnosis
    0 references

    Identifiers

    zbMATH DE Number
    5003982
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q814635&oldid=1087842"
      Powered by MediaWiki