Approximating cost-based abduction is NP-hard (Q814635)
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 5003982
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating cost-based abduction is NP-hard |
scientific article; zbMATH DE number 5003982 |
Statements
Approximating cost-based abduction is NP-hard (English)
0 references
7 February 2006
0 references
Explanation
0 references
Complexity
0 references
Uncertainty
0 references
Belief revision
0 references
Diagnosis
0 references
0 references
0.8151546716690063
0 references
0.7712355256080627
0 references
0.7683911919593811
0 references
0.7604957222938538
0 references
0.7604949474334717
0 references
