Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (Q2941745): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q129489730, #quickstatements; #temporary_batch_1724809781087 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1613/jair.4794 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1185084623 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129489730 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:14, 28 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks |
scientific article |
Statements
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks (English)
0 references
25 August 2015
0 references
