Fast library for number theory: an introduction

Authors:
William B. Hart
Affiliations:
Mathematics Institute, Warwick University, Coventry, United Kingdom
Venue:
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Year:
2010

Citing 4
Cited 5

A cache-friendly truncated FFT

Theoretical Computer Science
Faster polynomial multiplication via multipoint Kronecker substitution

Journal of Symbolic Computation
An LLL Algorithm with Quadratic Complexity

SIAM Journal on Computing
The sage project: unifying free mathematical software to create a viable alternative to magma, maple, mathematica and MATLAB

ICMS'10 Proceedings of the Third international congress conference on Mathematical software

Practical divide-and-conquer algorithms for polynomial arithmetic

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing
The decoding Library for list decoding

ACM Communications in Computer Algebra
Interfacing mathemagix with C++

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Fast algorithms for l-adic towers over finite fields

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Arb: a C library for ball arithmetic

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss FLINT (Fast Library for Number Theory), a library to support computations in number theory, including highly optimised routines for polynomial arithmetic and linear algebra in exact rings.