The complexity of finding \(k\)th most probable explanations in probabilistic networks (Q3075529)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5851898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding \(k\)th most probable explanations in probabilistic networks |
scientific article; zbMATH DE number 5851898 |
Statements
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks (English)
0 references
15 February 2011
0 references
0.8290742039680481
0 references
0.7881900668144226
0 references
0.7881899476051331
0 references
0.778395414352417
0 references
