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

数学元定理

Algorithmic Meta-Theorems

Stephan Kreutzer

摘要:

数学元定理是应用于整个问题的一般算法结果,而不仅仅是单个问题。它们通常有一个“逻辑”和一个“结构”的组成部分,也就是说,它们是以下形式的结果:可以在给定逻辑L中形式化的每个计算问题都可以在满足某些条件的每个结构类C上有效地求解。本文综述了近年来得到的算法元定理及其证明方法。由于许多元定理使用的结果,从图子理论,我们给一个简要介绍的理论开发的Robertson和Seymour为他们的证明图子定理和状态的主要算法的后果,这一理论,只要他们需要在理论的算法元定理。

英文摘要:

Algorithmic meta-theorems are general algorithmic results applying to a whole range of problems, rather than just to a single problem alone. They often have a "logical" and a "structural" component, that is they are results of the form: every computational problem that can be formalised in a given logic L can be solved efficiently on every class C of structures satisfying certain conditions. This paper gives a survey of algorithmic meta-theorems obtained in recent years and the methods used to prove them. As many meta-theorems use results from graph minor theory, we give a brief introduction to the theory developed by Robertson and Seymour for their proof of the graph minor theorem and state the main algorithmic consequences of this theory as far as they are needed in the theory of algorithmic meta-theorems.

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

↑