论红蓝卵石游戏的难度
On the Hardness of Red-Blue Pebble Games
摘要：
红蓝卵石游戏模拟了两级存储层次结构的计算成本。我们提出了各种硬度的结果，在不同的红蓝卵石的变种，重点是oneshot模型。我们首先研究以前介绍的红蓝卵石模型（基地，oneshot，nodel）之间的关系。我们还分析了一个新的变体（compcost），以获得更现实的计算模型。然后，我们证明了红蓝卵石是NP-困难的所有这些模型的变体。此外，我们表明，在oneshot模型，$δ$ -近似算法$δ<2$是唯一的游戏猜想是假的，只有可能的。最后，我们表明，贪心算法是不是很好的候选人近似，因为他们可以返回显着较差的解决方案比最佳。
英文摘要：
Red-blue pebble games model the computation cost of a two-level memory hierarchy. We present various hardness results in different red-blue pebbling variants, with a focus on the oneshot model. We first study the relationship between previously introduced red-blue pebble models (base, oneshot, nodel). We also analyze a new variant (compcost) to obtain a more realistic model of computation. We then prove that red-blue pebbling is NP-hard in all of these model variants. Furthermore, we show that in the oneshot model, a $δ$-approximation algorithm for $δ<2$ is only possible if the unique games conjecture is false. Finally, we show that greedy algorithms are not good candidates for approximation, since they can return significantly worse solutions than the optimum.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
