FLINT

swMATH297MaRDI QIDQ13059

No author found.

Described by source

No records found.

Related Items (60)

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

This page was built for software: FLINT