One hierarchy spawns another, graph deconstructions and the complexity classification of conjunctive queries (Q4608718)
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 6852232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One hierarchy spawns another, graph deconstructions and the complexity classification of conjunctive queries |
scientific article; zbMATH DE number 6852232 |
Statements
One Hierarchy Spawns Another (English)
0 references
22 March 2018
0 references
conjunctive queries
0 references
graph decompositions
0 references
homomorphisms
0 references
parameterized complexity
0 references
0.9949400424957277
0 references
0.8170298933982849
0 references
0.7728955149650574
0 references
0.7699391841888428
0 references
