一句话：提出超图点分解框架，给出统一 β-无环性与有界 MIM-width 的 Max-CSP 易解性条件。
（无界元数）Max-CSP 在结构限制下的复杂性仍缺乏理解；已知的两个最一般易解超图性质——β-无环性与有界（关联）MIM-width——互不可比且对应不同算法。本文引入超图的点分解（point decomposition）框架，由此得到一类结构限制下 Max-CSP 易解的新充分条件，并证明该条件同时推广有界 MIM-width 与 β-无环性。作为副产品，作者给出有界 MIM-width 的新刻画，并讨论与 Max-CSP 复杂性相关的其他超图性质，如 β-超树宽。
The complexity of (unbounded-arity) Max-CSPs under structural restrictions is poorly understood. The two most general hypergraph properties known to ensure tractability of Max-CSPs, β -acyclicity and bounded (incidence) MIM-width, are incomparable and lead to very different algorithms. We introduce the framework of point decompositions for hypergraphs and use it to derive a new sufficient condition for the tractability of (structurally restricted) Max-CSPs, which generalises both bounded MIM-width and β -acyclicity. On the way, we give a new characterisation of bounded MIM-width and discuss other hypergraph properties which are relevant to the complexity of Max-CSPs, such as β -hypertreewidth.