论文标题
微不足道的选择多项式时间：逻辑捕获PTIME
Insignificant Choice Polynomial Time: A Logic Capturing PTIME
论文作者
论文摘要
在本文中，使用非确定性的抽象状态计算机（ASM）进行了无序多项式时间（CPT），这些计算机（ASMS）受三个条件的限制：（1）选择仅限于原子之间的选择； （2）状态中的更新集必须是同构的； （3）对于$ s $和$ s $和$ s^\ prime $的任何两个同构更新集，相应后继状态的更新集集为同构。可以将限制纳入ASM规则的语义中，以便在满足条件的情况下仅产生更新集。此外，可以在模拟的图灵机上以多项式时间检查条件。最后，条件暗示着全球无关紧要，即最终结果与选择无关。这些属性足以证明ASM限制了这种方式定义逻辑捕获PTIME，我们称之为无关紧要的选择多项式时间（ICPT）
In this article choiceless polynomial time (CPT) is extended using non-determini\-stic Abstract State Machines (ASMs), which are restricted by three conditions: (1) choice is restricted to choice among atoms; (2) update sets in a state must be isomorphic; (3) for any two isomorphic update sets on states $S$ and $S^\prime$, respectively, the sets of update sets of the corresponding successor states are isomorphic. The restrictions can be incorporated into the semantics of ASM rules such that update sets are only yielded, if the conditions are satisfied. Furthermore, the conditions can be checked in polynomial time on a simulating Turing machine. Finally, the conditions imply global insignificance, i.e. the final result is independent from the choices. These properties suffice to show that the ASMs restricted this way define a logic capturing PTIME, which we call insignificant choice polynomial time (ICPT)
