arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1609.07895cs.LOcs.CCmath.LO
收藏

交互图:不确定自动机

Interaction Graphs: Nondeterministic Automata

Thomas Seiller

摘要:

本文给出了次线性非确定复杂性类的一系列语义刻画。这些结果属于复杂性理论和所谓的隐式计算复杂性(ICC)的基于逻辑的方法的一般域,即不参考特定的机器模型的复杂性类的描述。特别是,它与ICC的线性逻辑的基础上的结果,因为考虑的语义框架源于后者的工作。此外,所获得的特征具有几何性质:每个类都由群的特定作用通过保测度映射来表征。

英文摘要:

This paper exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes. These results fall into the general domain of logic-based approaches to complexity theory and so-called implicit computational complexity (ICC), i.e. descriptions of complexity classes without reference to specific machine models. In particular, it relates strongly to ICC results based on linear logic since the semantic framework considered stems from work on the latter. Moreover, the obtained characterisations are of a geometric nature: each class is characterised by a specific action of a group by measure-preserving maps.

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

↑