arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1105.3252math.GRcs.CC
收藏

群与半群理论中的次线性时间算法

Sublinear time algorithms in the theory of groups and semigroups

Vladimir Shpilrain

摘要:

次线性时间算法代表了计算中的一种新范式,其中算法必须在仅检查输入的一小部分后给出某种答案。考虑次线性时间算法的最典型的情况是属性测试。有几个有趣的背景下,人们可以测试性质在次线性时间。一个典型的例子是图的可着色性。要判断一个给定的图是不是k-可着色的,通常只需要检查一个有关联边的顶点就足够了:如果一个顶点的度大于k,那么这个图是不是k-可着色的。寻找可以在次线性时间内检验的代数性质是一个具有挑战性和有趣的任务。在本文中,我们解决了几个算法的问题,在理论的群体和半群,可能承认次线性时间的解决方案,至少对“大多数”的输入。

英文摘要:

Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are considered is property testing. There are several interesting contexts where one can test properties in sublinear time. A canonical example is graph colorability. To tell that a given graph is not k-colorable, it is often sufficient to inspect just one vertex with incident edges: if the degree of a vertex is greater than k, then the graph is not k-colorable. It is a challenging and interesting task to find algebraic properties that could be tested in sublinear time. In this paper, we address several algorithmic problems in the theory of groups and semigroups that may admit sublinear time solution, at least for "most" inputs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑