Characterizing co-NL by a group action

  title={Characterizing co-NL by a group action},
  author={Cl{\'e}ment Aubert and Thomas Seiller},
  journal={Mathematical Structures in Computer Science},
  pages={606 - 638}
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 class co-NL can be characterized using this new approach. We introduce the non-deterministic pointer machine as a technical tool, a concrete… 

Logarithmic space and permutations

L O ] 3 J un 2 01 9 Logarithmic Space and Permutations ✩

In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed how Girard’s

Interaction Graphs

  • T. Seiller
  • Computer Science
    ACM Trans. Comput. Log.
  • 2018
This article exhibits a series of semantic characterisations of sublinear nondeterministic complexity classes without reference to specific machine models, which relates strongly to icc results based on linear logic, since the semantic framework considered stems from work on the latter.

Interaction graphs: Additives

Interaction Graphs: Exponentials

  • T. Seiller
  • Mathematics, Computer Science
    Log. Methods Comput. Sci.
  • 2019
It is explained how this framework can be used to define a GoI for Elementary Linear Logic with second-order quantification, a sub-system of linear logic that captures the class of elementary time computable functions.

Probabilistic Complexity Classes through Semantics

This paper shows how this semantic approach to Implicit Complexity Theory (ICC) can be used to characterise deterministic and probabilistic models of computation, and provides the first implicit characterisations of the classes PLogspace and PPtime.

A correspondence between maximal abelian sub-algebras and linear logic fragments

  • T. Seiller
  • Mathematics
    Mathematical Structures in Computer Science
  • 2016
A modified construction of Girard's hyperfinite geometry of interaction of interaction is exposed, showing a correspondence between a classification of maximal abelian sub-algebras (MASAs) proposed by Jacques Dixmier and fragments of linear logic.

Interaction Graphs and Complexity

This work proposes a new approach where semantical restrictions instead of syntactical ones are considered, which leads to a hierarchy of models mirroring subtle distinctions about computational principles.

Interaction graphs: Graphings

Towards a Complexity-through-Realizability Theory

The background, motivations and perspectives of this complexity-through-Realisability theory to be developed are provided, and it is illustrated with recent results.



Interaction graphs: Additives

Interaction graphs: Multiplicatives

  • T. Seiller
  • Computer Science, Mathematics
    Ann. Pure Appl. Log.
  • 2012

Elementary Complexity and Geometry of Interaction

A geometry of interaction model given by an algebra of clauses equipped with resolution into which proofs of Elementary Linear Logic can be interpreted is introduced.

Geometry of Interaction 1: Interpretation of System F

The geometry of linear higher-order recursion

  • Ugo Dal Lago
  • Computer Science
    20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
  • 2005
The framework stems from Gonthier's original work and turns out to be a versatile and powerful tool for the quantitative analysis of normalization in presence of constants and higher-order recursion.

Geometry of Interaction V: Logic in the hyperfinite factor

Bounded Linear Logic, Revisited

QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic, is presented, which provides compositional embeddings of Leivant's RRW and Hofmann's LFPL into QBAL.

Stratified Bounded Affine Logic for Logarithmic Space

  • Ulrich Schöpp
  • Computer Science, Mathematics
    22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)
  • 2007
This paper introduces stratified bounded affine logic (SBAL), a restricted version of bounded linear logic, in which not only the modality, but also the universal quantifier is bounded by a resource polynomial.

Sublogarithmic uniform Boolean proof nets

A novel translation in AC0 is presented and a simpler restricted notion of uniform Boolean proof nets is focused on, which can then encode constant-depth circuits and compare complexity classes below logspace, which were out of reach with the previous translations.

Computational Complexity: A Modern Approach

This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory and can be used as a reference for self-study for anyone interested in complexity.