TL;DR证明了检查分数超树宽度是否小于等于 k 的复杂度为 NP 完全问题,即使 k 为 2,同时证明了检查广义超树宽度是否小于等于 k 的复杂度同样为 NP 完全问题。
Abstract
hypertree decompositions, as well as the more powerful generalized hypertree
decompositions (GHDs), and the yet more general fractional hypertree
decompositions (FHD) are hypergraph decomposition methods successfully used for
answering conjunctive queries and for the solution of constr