arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.05529cs.CC
收藏

参数化细粒度约简

Parameterized Fine-Grained Reductions

Elli Anastasiadi, Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis

摘要:

近年来,细粒度复杂性领域蓬勃发展,产生了大量的结果,对计算机科学社区产生了应用和理论上的影响。该框架的基石是细粒度约简的概念,它与问题的确切复杂性相关联,以便继续改进其运行时间或硬度结果。我们提供了一个参数化的观点,这些减少(PFGR),以进一步分析结构的可改进的问题,并设置一个统一的方法扩展算法的结果的基础。在这种情况下,我们定义了一类问题(FPI),承认固定参数的改进,其运行时间。作为这个框架的应用,我们提出了一个真正的次二次固定参数算法的正交向量问题。最后,我们提供了一个电路表征FPI进一步巩固的概念,改进。

英文摘要:

During recent years the field of fine-grained complexity has bloomed to produce a plethora of results, with both applied and theoretical impact on the computer science community. The cornerstone of the framework is the notion of fine-grained reductions, which correlate the exact complexities of problems such that improvements in their running times or hardness results are carried over. We provide a parameterized viewpoint of these reductions (PFGR) in order to further analyze the structure of improvable problems and set the foundations of a unified methodology for extending algorithmic results. In this context, we define a class of problems (FPI) that admit fixed-parameter improvements on their running time. As an application of this framework we present a truly sub-quadratic fixed-parameter algorithm for the orthogonal vectors problem. Finally, we provide a circuit characterization for FPI to further solidify the notion of improvement.

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

↑