One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (Q4635616)
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 6863090
| 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 6863090 |
Statements
One hierarchy spawns another (English)
0 references
23 April 2018
0 references
conjunctive queries
0 references
graph decompositions
0 references
homomorphisms
0 references
parameterized complexity
0 references
0.9949400424957277
0 references
0.8166358470916748
0 references
0.7681666016578674
0 references
0.7521327137947083
0 references
