Structural tractability of counting of solutions to conjunctive queries (Q269342): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68P15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6570160 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
conjunctive queries | |||
| Property / zbMATH Keywords: conjunctive queries / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
counting complexity | |||
| Property / zbMATH Keywords: counting complexity / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
hypergraph decomposition techniques | |||
| Property / zbMATH Keywords: hypergraph decomposition techniques / rank | |||
Normal rank | |||
Revision as of 15:11, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
