利用伪布尔可满足性优化求解MCM问题
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
摘要：
本文描述了多常数乘法（MCM）问题到伪布尔可满足性（PBS）的三种编码，并介绍了一种最优求解MCM问题的算法。据我们所知，所提出的编码和优化算法是第一次正式的MCM问题在PBS的方式。该报告评估了问题大小的复杂性和几个PBS求解器在三种编码上的性能。
英文摘要：
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the MCM problem optimally. To the best of our knowledge, the proposed encodings and the optimization algorithm are the first formalization of the MCM problem in a PBS manner. This report evaluates the complexity of the problem size and the performance of several PBS solvers over three encodings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
