尖峰时刻逻辑复杂度的极限
Limits of Rush Hour Logic Complexity
摘要：
尖峰时刻逻辑在[Flake &Baum99]中被引入，作为一种受“尖峰时刻”玩具拼图启发的计算模型，其中汽车可以在停车场内水平或垂直移动。作者展示了该模型如何支持多项式空间计算，使用某些汽车配置作为构建块来构建cpu和内存的布尔电路。他们认为使用长度为3的汽车对他们的建造至关重要，并推测只有尺寸为2的汽车，我们称之为“尺寸2高峰小时”，不支持多项式空间计算。我们解决了这个猜想，所需的积木是在大小2高峰时间建设。此外，我们认为单位尖峰时刻，这是迄今为止被认为是微不足道的，显示其关系的迷宫谜题，并提供经验支持其硬度。
英文摘要：
Rush Hour Logic was introduced in [Flake&Baum99] as a model of computation inspired by the ``Rush Hour'' toy puzzle, in which cars can move horizontally or vertically within a parking lot. The authors show how the model supports polynomial space computation, using certain car configurations as building blocks to construct boolean circuits for a cpu and memory. They consider the use of cars of length 3 crucial to their construction, and conjecture that cars of size 2 only, which we'll call `Size 2 Rush Hour', do not support polynomial space computation. We settle this conjecture by showing that the required building blocks are constructible in Size 2 Rush Hour. Furthermore, we consider Unit Rush Hour, which was hitherto believed to be trivial, show its relation to maze puzzles, and provide empirical support for its hardness.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
