离散优化的复杂性代数理论
An Algebraic Theory of Complexity for Discrete Optimisation
摘要:
离散优化问题出现在许多不同的领域,并以许多不同的名称进行研究。在许多这样的问题中,要优化的量可以表示为限制形式的函数之和。在这里,我们提出了一个统一的复杂性理论,这类问题。我们证明了有限域离散优化问题的复杂性是由目标函数的某些代数性质决定的,我们称之为加权多态性。我们定义了一个伽罗瓦连接集之间的合理价值的功能和加权多态性集,并展示了如何封闭的伽罗瓦连接的特点。这些结果为研究离散优化问题的复杂性提供了一种新的途径。我们使用这种方法来确定某些最大的一般问题的易处理的子问题,从而得出一个完整的分类的布尔情况下的复杂性。
英文摘要:
Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a unifying theory of complexity for problems of this kind. We show that the complexity of a finite-domain discrete optimisation problem is determined by certain algebraic properties of the objective function, which we call weighted polymorphisms. We define a Galois connection between sets of rational-valued functions and sets of weighted polymorphisms and show how the closed sets of this Galois connection can be characterised. These results provide a new approach to studying the complexity of discrete optimisation. We use this approach to identify certain maximal tractable subproblems of the general problem, and hence derive a complete classification of complexity for the Boolean case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。