基于仿射不变性的方法用于多项式复杂度类的分离
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
AI总结:
本文提出基于仿射不变性的方法,通过相对正则性概念探讨多项式复杂度类的分离问题,并指出其在理论上的挑战与优势。
摘要:
我们探讨了将仿射不变量片段的P与NP、resp. PSPACE分离的可能性。我们基于Otto定理,该定理指出P中的仿射不变查询恰好是那些在多模态μ-演算中可定义的,利用模型检查中已知的构造,将多模态μ-演算中的可定义性转换为在所谓幂图类中的普通模态μ-演算中的可定义性,从而产生相对正则性的概念。我们给出了某些NP、resp. PSPACE中的仿射不变查询的例子,并以特定树语言家族的相对非正则性来表征它们在P中的成员资格。证明所有此类家族成员的非正则性将分离相应的类与P,但涉及的组合复杂性很高。另一方面,进入仿射不变量世界缓解了其他描述复杂性方法在研究P与更高类之间关系时所遭受的顺序问题。
英文摘要:
We investigate the possibility to separate the bisimulation-invariant fragment of P from that of NP, resp. PSPACE. We build on Otto's Theorem stating that the bisimulation-invariant queries in P are exactly those that are definable in the polyadic mu-calculus, and use a known construction from model checking in order to reduce definability in the polyadic $μ$-calculus to definability in the ordinary modal mu-calculus within the class of so-called power graphs, giving rise to a notion of relative regularity. We give examples of certain bisimulation-invariant queries in NP, resp. PSPACE, and characterise their membership in P in terms of relative non-regularity of particular families of tree languages. A proof of non-regularity for all members of one such family would separate the corresponding class from P, but the combinatorial complexity involved in it is high. On the plus side, the step into the bisimulation-invariant world alleviates the order-problem that other approaches in descriptive complexity suffer from when studying the relationship between P and classes above.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。