arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1504.08011cs.DScs.DMmath.COquant-ph
收藏

硬图论问题求解方法的比较

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

Victoria Horan, Steve Adachi, Stanley Bak

摘要:

为了用公式表示可能为真的数学命题,必须确定一些基本情况。然而,许多组合问题是NP难的,并且计算复杂性使得在典型计算机上使用标准蛮力方法的研究方法变得困难。探索的一个示例问题是找到最小识别码。为了解决计算问题,探索了各种方法,包括使用Matlab的并行计算方法,使用D-Wave计算机的量子退火方法,最后使用可满足性模理论(SMT)和相应的SMT求解器。这些方法中的每一种都需要以独特的方式来表达问题。在本文中,我们解决了这些方法的计算解决方案,这个NP难问题的挑战。

英文摘要:

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a standard brute force approach on a typical computer. One sample problem explored is that of finding a minimum identifying code. To work around the computational issues, a variety of methods are explored and consist of a parallel computing approach using Matlab, a quantum annealing approach using the D-Wave computer, and lastly using satisfiability modulo theory (SMT) and corresponding SMT solvers. Each of these methods requires the problem to be formulated in a unique manner. In this paper, we address the challenges of computing solutions to this NP-hard problem with respect to each of these methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑