The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs (Q5028455)
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 7471691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs |
scientific article; zbMATH DE number 7471691 |
Statements
9 February 2022
0 references
probabilistic graphs
0 references
probabilistic databases
0 references
probabilistic query evaluation
0 references
infinite unions of conjunctive queries
0 references
data complexity dichotomy
0 references
\#P-hardness
0 references
0 references
0.8007479310035706
0 references
0.7612595558166504
0 references
0.7468031048774719
0 references
0.7374073266983032
0 references
