activity
20082025
most citedGeneral and Fractional Hypertree Decompositions: Hard and Easy Cases

14 citations · 43 across the 14 of their papers we have counts for

collaborators
Showing cs.AIShow all

1 paper · 1 filter

cs.AI2020

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions

Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +2

Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The st…