arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.07786cs.CCcs.FL
收藏

形式语言的扩展复杂性

Extension Complexity of Formal Languages

Hans Raj Tiwary

摘要:

本文从形式语言的角度对可拓复杂性进行了研究。我们定义了一个自然的方式来关联一个家庭的多面体与二进制语言。这允许我们定义形式语言的扩展复杂度的概念。我们证明了几个封闭性的语言承认紧凑的扩展配方。此外,我们还给出了紧凑语言的一个充分的机器刻画。我们证明了这种机器的特性的效用,通过获得上界的多面体的问题,在不确定性的对数空间,在流模型的下界,和几个多面体的扩展复杂性的上界。

英文摘要:

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension complexity of formal languages. We prove several closure properties of languages admitting compact extended formulations. Furthermore, we give a sufficient machine characterization of compact languages. We demonstrate the utility of this machine characterization by obtaining upper bounds for polytopes for problems in nondeterministic logspace; lower bounds in streaming models; and upper bounds on extension complexities of several polytopes.

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

↑