An in-between "implicit" and "explicit" complexity: Automata
From MaRDI portal
Publication:6258673
arXiv1502.00145MaRDI QIDQ6258673FDOQ6258673
Authors: Clément Aubert 
Publication date: 31 January 2015
Abstract: 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.
This page was built for publication: An in-between "implicit" and "explicit" complexity: Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6258673)
