14 citations · 43 across the 14 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DB2016★ 14 cited
General and Fractional Hypertree Decompositions: Hard and Easy Cases
Wolfgang Fischl, Georg Gottlob, Reinhard Pichler
Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergrap…
cs.CC2016
A Complexity Theory for Hard Enumeration Problems
Nadia Creignou, Markus Kröll, Reinhard Pichler +2
Complexity theory provides a wealth of complexity classes for analyzing the complexity of decision and counting problems. Despite the practical relevance of enumeration problems, t…