FLINT

swMATH297MaRDI QIDQ13059FDOQ13059

Author name not available (Why is that?)

Described by source

• Fast Library for Number Theory: An Introduction

Cited In (60)

• Sparse polynomials in FLINT
• Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
• An infinite family of cubics with emergent reducibility at depth 1
• Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F _P ^r
• Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function
• Algebraic Polytopes in Normaliz
• Efficient implementation of the Hardy–Ramanujan–Rademacher formula
• No two non-real conjugates of a Pisot number have the same imaginary part
• An efficient subsumption test pipeline for BS(LRA) clauses
• Sato-Tate distributions
• Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields
• On the distribution of the Picard ranks of the reductions of a \(K3\) surface
• Reconstructing rational functions with \texttt{FireFly}
• Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
• NFLlib: NTT-Based Fast Lattice Library
• On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
• Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
• Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
• Computing isomorphisms and embeddings of finite fields
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• Non-commutative Iwasawa theory for modular forms
• A fast algorithm for reversion of power series
• The Basic Polynomial Algebra Subprograms
• Short proof of Rademacher's formula for partitions
• Detecting similarity of rational plane curves
• Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings
• SPASS-SATT. A CDCL(LA) solver
• A divisibility result in combinatorics of generalized braids
• Relaxed algorithms for \(p\)-adic numbers
• CUMODP
• Planar master integrals for four-loop form factors
• Employing C++ Templates in the Design of a Computer Algebra Library
• Improved algorithms for left factorial residues
• Lattices of compatibly embedded finite fields in nemo/flint
• A cache-friendly truncated FFT
• Basic Polynomial Algebra Subprograms
• Improvements to the deformation method for counting points on smooth projective hypersurfaces
• Current Challenges in Developing Open Source Computer Algebra Systems
• A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
• Standard Lattices of Compatibly Embedded Finite Fields
• Unconditional class group tabulation of imaginary quadratic fields to \(| \Delta| < 2^{40}\)
• Sparse polynomial arithmetic with the BPAS library
• Congruences satisfied by eta-quotients
• The Sage Project: Unifying Free Mathematical Software to Create a Viable Alternative to Magma, Maple, Mathematica and MATLAB
• Exterior powers of the adjoint representation and the Weyl ring of \(E_8\)
• On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics.
• Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration
• The basic polynomial algebra subprograms
• A faster tree-decomposition based algorithm for counting linear extensions
• Exact \(p\)-adic computation in Magma
• Ansätze for scattering amplitudes from \(p\)-adic numbers and algebraic geometry
• Simultaneous Conversions with the Residue Number System Using Linear Algebra
• Primitive elements with prescribed traces
• A computer algorithm for the BGG resolution
• On the evaluation of some sparse polynomials
• Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants
• Randomized root finding over finite FFT-fields using tangent Graeffe transforms
• New constructions of hinting PRGs, OWFs with encryption, and more
• All the trinomial roots, their powers and logarithms from the Lambert series, Bell polynomials and Fox-Wright function: illustration for genome multiplicity in survival of irradiated cells
• Experimental evidence for Maeda's conjecture on modular forms

This page was built for software: FLINT