The following pages link to FLINT (Q13059):
Displaying 10 items.
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation (Q5146000) (← links)
- Congruences satisfied by eta-quotients (Q5150178) (← links)
- Efficient implementation of the Hardy–Ramanujan–Rademacher formula (Q5169644) (← links)
- Basic Polynomial Algebra Subprograms (Q5178932) (← links)
- An infinite family of cubics with emergent reducibility at depth 1 (Q5236047) (← links)
- The basic polynomial algebra subprograms (Q5270199) (← links)
- Sparse polynomials in FLINT (Q5270202) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB (Q5747850) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)