Probabilistic Complexity Classes through Semantics - Université Sorbonne Paris Nord Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Probabilistic Complexity Classes through Semantics

Résumé

In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used to obtain implicit characterisations of non-deterministic complexity classes. In this paper, we show how this semantic approach to Implicit Complexity Theory (ICC) can be used to characterise deterministic and probabilistic models of computation. In doing so, we obtain correspondences between group actions and both deterministic and probabilistic hierarchies of complexity classes. As a particular case, we provide the first implicit characterisations of the classes PLogspace (un-bounded error probabilistic logarithmic space) and PPtime (unbounded error probabilistic polynomial time)
Fichier principal
Vignette du fichier
Prob-ICC-short.pdf (306.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02458358 , version 1 (28-01-2020)
hal-02458358 , version 2 (10-02-2023)

Identifiants

Citer

Thomas Seiller. Probabilistic Complexity Classes through Semantics. 2020. ⟨hal-02458358v1⟩

Collections

GALILE
115 Consultations
48 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More