Theory-Contraction is NP-Complete (Q4465167)
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 2068674
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theory-Contraction is NP-Complete |
scientific article; zbMATH DE number 2068674 |
Statements
Theory-Contraction is NP-Complete (English)
0 references
27 May 2004
0 references
computational complexity
0 references
finite belief-systems
0 references
contractions of dependency-networks
0 references
0.7665403485298157
0 references
0.7376901507377625
0 references
0.7308731079101562
0 references
0.7028042078018188
0 references
0.7012944221496582
0 references
