FLINT
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Lattices of compatibly embedded finite fields in Nemo/Flint
- Standard lattices of compatibly embedded finite fields
- Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function
- An efficient subsumption test pipeline for BS(LRA) clauses
- No two non-real conjugates of a Pisot number have the same imaginary part
- 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
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
- Computing isomorphisms and embeddings of finite fields
- Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
- Non-commutative Iwasawa theory for modular forms
- A fast algorithm for reversion of power series
- Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
- Simultaneous conversions with the residue number system using linear algebra
- Current challenges in developing open source computer algebra systems
- Sparse polynomials in FLINT
- Short proof of Rademacher's formula for partitions
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization
- Detecting similarity of rational plane curves
- Relaxed algorithms for \(p\)-adic numbers
- 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
- An infinite family of cubics with emergent reducibility at depth 1
- Efficient implementation of the Hardy-Ramanujan-Rademacher formula
- CUMODP
- Algebraic polytopes in Normaliz
- Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F P r
- Planar master integrals for four-loop form factors
- CoCoALib
- FFLAS-FFPACK
- FOXBOX
- gmp
- IML - Integer Matrix Library
- LinBox
- M4RI
- Mathemagix
- NTL
- PARI/GP
- ALTRAN
- WAPR
- MPIR
- Kiss FFT
- TRIP
- modpn
- Juno-2
- MPC
- Arb
- a-tint
- BPAS
- CUMODP
- SimplifySum
- mpiP
- Charm
- resolve.lib
- transalpyne
- PATSYM
- Antic
- gitfan.lib
- strongSwan
- locnormal.lib
- modnormal.lib
- normal.lib
- paraplanecurves.lib
- parallel.lib
- polymake.so
- FDLIBM
- zn_poly
- LambertW
- Mmxlib
- Muntingh
- Algorithm 917
- Hecke
- Nemo
- SLV
- mplrs
- Rings
- CLGRP
- liboptarith
- Algorithm 443
- NormalizInterface
- Genus2Conductor
- ExactpAdics
- cutgeneratingfunctionology
- openf4
- Kronrod Extensions
- manYPoints
- pAdicGaloisGroup
- wrightOmegaq
- yaml-cpp
- lrsarith
- lrslib
- tinygb
- eta-quotients
- Improved algorithms for left factorial residues
This page was built for software: FLINT
