Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?

DOI10.1007/978-3-319-12466-7_3zbMath1445.68045OpenAlexW1504307594MaRDI QIDQ3460503

Emanuele Cesena, Rachid Ouchary, Luca Roversi, Daniele Canavese, Marco Pedicini

Publication date: 7 January 2016

Published in: Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12466-7_3

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Functional programming and lambda calculus (68N18)

Related Items (1)

Abstract machines, optimal reduction, and streams

This page was built for publication: Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?