The following pages link to FLINT (Q13059):
Displayed 50 items.
- Experimental evidence for Maeda's conjecture on modular forms (Q390594) (← links)
- Relaxed algorithms for \(p\)-adic numbers (Q449711) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Improvements to the deformation method for counting points on smooth projective hypersurfaces (Q895704) (← links)
- A cache-friendly truncated FFT (Q1029334) (← links)
- Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration (Q1681770) (← links)
- 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 (Q1714102) (← links)
- Sparse polynomial arithmetic with the BPAS library (Q1798304) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- Primitive elements with prescribed traces (Q2081329) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- A computer algorithm for the BGG resolution (Q2216568) (← links)
- Exact \(p\)-adic computation in Magma (Q2229728) (← links)
- Detecting similarity of rational plane curves (Q2252245) (← links)
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\) (Q2300484) (← links)
- SPASS-SATT. A CDCL(LA) solver (Q2305409) (← links)
- Planar master integrals for four-loop form factors (Q2315709) (← links)
- Records on the vanishing of Fourier coefficients of powers of the Dedekind eta function (Q2316273) (← links)
- Short proof of Rademacher's formula for partitions (Q2316343) (← links)
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (Q2351480) (← links)
- A divisibility result in combinatorics of generalized braids (Q2401982) (← links)
- Mathematical software -- ICMS 2010. Third international congress on mathematical software, Kobe, Japan, September 13--17, 2010. Proceedings (Q2638151) (← links)
- Improved algorithms for left factorial residues (Q2656342) (← links)
- On the distribution of the Picard ranks of the reductions of a \(K3\) surface (Q2660591) (← links)
- Ansätze for scattering amplitudes from \(p\)-adic numbers and algebraic geometry (Q2694409) (← links)
- Reconstructing rational functions with \texttt{FireFly} (Q2698810) (← links)
- Unconditional class group tabulation of imaginary quadratic fields to $\|\Delta \| < 2^{40}$ (Q2796029) (← links)
- NFLlib: NTT-Based Fast Lattice Library (Q2799029) (← links)
- Current Challenges in Developing Open Source Computer Algebra Systems (Q2807814) (← links)
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms (Q2819758) (← links)
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics (Q2829108) (← links)
- Non-commutative Iwasawa theory for modular forms (Q2848487) (← links)
- The Basic Polynomial Algebra Subprograms (Q2879193) (← links)
- No two non-real conjugates of a Pisot number have the same imaginary part (Q2953214) (← links)
- Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic (Q3090902) (← links)
- Sato-Tate distributions (Q3295946) (← links)
- <b>CUMODP</b> (Q4577844) (← links)
- Simultaneous Conversions with the Residue Number System Using Linear Algebra (Q4581392) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- Lattices of compatibly embedded finite fields in nemo/flint (Q4630309) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- Algebraic Polytopes in Normaliz (Q5039571) (← links)
- Employing C++ Templates in the Design of a Computer Algebra Library (Q5041073) (← links)
- Standard Lattices of Compatibly Embedded Finite Fields (Q5120483) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk (Q5145100) (← links)
- Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F <i> <sub>P</sub> <sup>r</sup> </i> (Q5145994) (← links)