We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but size is bounded by s(n). Recently, such machines were introduced as a formalization of a computation model that restricts random access to external memory and internal memory space. Here, each of the tapes with a restriction on the head reversals corresponds to an external memory device, and the tapes of restricted size model internal memory. We use ST(r(n),s(n),O(1)) to denote the class of all problems that can be solved by deterministic Turing machines that comply to the above resource bounds. Similarly, NST and RST, respectively, are used for the corresponding nondeterministic and randomized classes.
While previous papers focused on lower bounds for particular problems, including sorting, the set equality problem, and several query evaluation problems, the present paper addresses the relations between the (R,N)ST-classes and classical complexity classes and investigates the structural complexity of the (R,N)ST-classes. Our main results are (1) a trade-off between internal memory space and external memory head reversals, (2) correspondences between the (R,N)ST-classes and ``classical'' time-bounded, space-bounded, reversal-bounded, and circuit complexity classes, and (3) hierarchies of (R)ST-classes in terms of increasing numbers of head reversals on external memory tapes.
Complexity Classes of Equivalence Problems Revisited
为了确定两个数字列表是否是同一个集合,我们对两个列表进行排序,看看是否得到相同的结果。排序列表是集合相等的等价关系的标准形式。其他标准形式出现在图同构算法中,以及由生成元给出的置换群的相等性。然而,为了确定两个图是否是共谱的(具有相同的特征值),我们计算它们的特征多项式,看看它们是否相同;特征多项式是共谱等价关系的完全不变量。这是弱于一个标准形式,它是不知道是否存在一个多项式时间的标准形式的共谱。请注意,一个等价关系在多项式时间内是可判定的,而不需要一个完整的不变量或标准形式,这是先验可能的。Blass和Gurevich(SIAM J. Comput.,1984)问是否这些条件的等价关系-有一个FP标准形式,有一个FP完全不变量,只是在P -实际上是不同的。他们表明,这个问题需要非相对化技术来解决。在这里,我们扩展了他们的结果,并给出了新的连接概率和量子计算。
Columbia University(哥伦比亚大学);Moscow State University(莫斯科国立大学);HSE University(高等经济大学);Yandex;Department of Mathematics and Exeter College, University of Oxford(牛津大学数学系与埃克塞特学院)
NP-hardness of the cluster minimization problem revisited
重新讨论了“簇极小化问题”的计算复杂性[L. T. Wille和J. Vennik,J.Phys.A18,L419(1985)]。有人认为,原始的NP-硬度证明不适用于物理意义上的成对势,例如那些取决于粒子之间几何距离的势。原问题的几何模拟制定,并提供了一个新的证明,这种潜力的多项式时间转换从单位盘图的独立集问题。这种提法的局限性,并承担更直接的后果集群的数值研究提出了新的子问题。