Keywords |
Keywords: Implicit computational complexity
|
@article{Canavese2015,
number = {3},
volume = {111},
month = {November},
author = {Canavese, Daniele and Cesena, Emanuele and Ouchary, Rachid and
Pedicini, Marco and Roversi, Luca},
issn = {0167-6423},
note = {},
keywords = {Implicit computational complexity },
url = {http://www.di.unito.it/~rover/RESEARCH/PUBLICATIONS/2015-SCICOJ/CanaveseCesenaOucharyPediciniRoversiSCICO215.pdf},
title = {Light combinators for finite fields arithmetic },
doi = {http://dx.doi.org/10.1016/j.scico.2015.04.001},
journal = {Science of Computer Programming },
pages = {365 --- 394 },
year = {2015},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)
