Author:
AUBERT CLÉMENT,SEILLER THOMAS
Abstract
In a recent paper, Girard (2012) proposed to use his recent construction of a geometry of interaction in the hyperfinite factor (Girard 2011) in an innovative way to characterize complexity classes. We begin by giving a detailed explanation of both the choices and the motivations of Girard's definitions. We then provide a complete proof that the complexity classco-NLcan be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete model to compute algorithms.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. INTERACTION GRAPHS: EXPONENTIALS;LOG METH COMPUT SCI;2019
2. Interaction Graphs;ACM Transactions on Computational Logic;2018-07-31
3. UNIFICATION AND LOGARITHMIC SPACE;LOG METH COMPUT SCI;2018
4. Interaction graphs: Graphings;Annals of Pure and Applied Logic;2017-02
5. Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach;Mathematical Structures in Computer Science;2016-11-10