136 citations · 313 across the 25 of their papers we have counts for
1 paper · 1 filter
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them…