Uniform reliability of self-join-free conjunctive queries
From MaRDI portal
Cites work
- A dichotomy in the complexity of counting database repairs
- Mathematical Properties of the Banzhaf Power Index
- Probabilistic databases
- Stochastic Games
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The complexity of the counting constraint satisfaction problem
- The dichotomy of probabilistic inference for unions of conjunctive queries
This page was built for publication: Uniform reliability of self-join-free conjunctive queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229590)