The computational complexity of probabilistic inference using Bayesian belief networks (Q2638807): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/ai/Cooper90, #quickstatements; #temporary_batch_1731547958265 |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0004-3702(90)90060-d / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1980452149 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/ai/Cooper90 / rank | |||
Normal rank |
Latest revision as of 03:01, 14 November 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The computational complexity of probabilistic inference using Bayesian belief networks |
scientific article |
Statements
The computational complexity of probabilistic inference using Bayesian belief networks (English)
0 references
1990
0 references
Bayesian belief networks
0 references
probabilistic inference
0 references
NP-hard
0 references
0 references
0 references