差的置换重构
Permutation Reconstruction from Differences
摘要:
我们证明了给定绝对差$|π_{i+1}-π_i|$,$i = 1,\dotsc,n-1$的整数$[1\dotso n]$的置换$π_1,\dotsc,π_n$的重构问题是NP-完全的。作为一个中间步骤,我们首先证明了一个新的益智游戏,我们称之为疯狂青蛙拼图的决策版本的NP完全性。由差分重构置换是最简单的组合问题之一,但已被证明是计算上难以处理的。
英文摘要:
We prove that the problem of reconstructing a permutation $π_1,\dotsc,π_n$ of the integers $[1\dotso n]$ given the absolute differences $|π_{i+1}-π_i|$, $i = 1,\dotsc,n-1$ is NP-complete. As an intermediate step we first prove the NP-completeness of the decision version of a new puzzle game that we call Crazy Frog Puzzle. The permutation reconstruction from differences is one of the simplest combinatorial problems that have been proved to be computationally intractable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。