An in-between "implicit" and "explicit" complexity: Automata - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2015

An in-between "implicit" and "explicit" complexity: Automata

Résumé

Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory contributed to complexity with a machine-dependant with implicit bounds model.
Fichier principal
Vignette du fichier
standalone.pdf (127.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01111737 , version 1 (30-01-2015)
hal-01111737 , version 2 (29-05-2015)

Licence

Licence Ouverte - etalab

Identifiants

Citer

Clément Aubert. An in-between "implicit" and "explicit" complexity: Automata. 2015. ⟨hal-01111737v1⟩
444 Consultations
253 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More