Generalized hypertree decompositions: NP-hardness and tractable variants (Q3452226)
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 6507208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized hypertree decompositions: NP-hardness and tractable variants |
scientific article; zbMATH DE number 6507208 |
Statements
Generalized hypertree decompositions: NP-hardness and tractable variants (English)
0 references
11 November 2015
0 references
conjunctive query
0 references
NP-complete
0 references
tree projection problem
0 references
acyclic
0 references
hypergraph
0 references
hypertree decomposition
0 references
tractable
0 references
0.8917884230613708
0 references
0.8525635004043579
0 references
0.8298501968383789
0 references
0.8157405853271484
0 references
