An in-between "implicit" and "explicit" complexity: Automata - Archive ouverte HAL
Conference Papers Year : 2015

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

Abstract

Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of computation, 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.

Domains

Logic in Computer Science [cs.LO] Logic [math.LO] Computational Complexity [cs.CC]
Fichier principal
Vignette du fichier
standalone.pdf (300.25 Ko) Télécharger le fichier
diapo_aubert_15_04_12.pdf (624.04 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Origin Files produced by the author(s)

Clément Aubert  : Connect in order to contact the contributor

https://hal.science/hal-01111737

Submitted on : Friday, May 29, 2015-11:18:30 AM

Last modification on : Friday, December 27, 2024-7:46:32 PM

Long-term archiving on : Monday, April 24, 2017-5:44:57 PM

Download

Dates and versions

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

Licence

Open licence - etalab

Identifiers

Cite

Clément Aubert. An in-between "implicit" and "explicit" complexity: Automata. DICE 2015 - Developments in Implicit Computational Complexity, Apr 2015, Londres, United Kingdom. ⟨hal-01111737v2⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UGA CNRS INRIA LACL LIG UPEC INRIA2 LIG-MFML-SPADES ANR LIG_SIDCH
465 View
280 Download

Altmetric

Share

More