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 this page instead for the normal view: Theory-Contraction is NP-Complete |
scientific article; zbMATH DE number 2068674
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
