Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (Q2941745)

From MaRDI portal
Revision as of 21:16, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks
scientific article

    Statements

    title
    Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (English)
    0 references
    DOI
    10.1613/jair.4794
    0 references
    author
    Johan Kwisthout
    0 references
    publication date
    25 August 2015
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    62H30
    0 references
    68T05
    0 references
    zbMATH DE Number
    6475333
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2941745&oldid=15936935"
    Powered by MediaWiki