Switch to: Citations

Add references

You must login to add references.
  1. Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks.Solomon E. Shimony & Carmel Domshlak - 2003 - Artificial Intelligence 151 (1-2):213-225.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-9b866bbb8-9kmcf uwo