Theory-Contraction is NP-Complete (Q4465167): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:37, 7 February 2024
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
