Structural tractability of counting of solutions to conjunctive queries (Q269342)
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: Structural tractability of counting of solutions to conjunctive queries |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Structural tractability of counting of solutions to conjunctive queries |
scientific article |
Statements
Structural tractability of counting of solutions to conjunctive queries (English)
0 references
18 April 2016
0 references
conjunctive queries
0 references
counting complexity
0 references
hypergraph decomposition techniques
0 references
0 references
0.8535299301147461
0 references
0.847709059715271
0 references
0.8188582062721252
0 references
0.8121844530105591
0 references
0.80564945936203
0 references
