Pages that link to "Item:Q5747866"
From MaRDI portal
The following pages link to Fast Library for Number Theory: An Introduction (Q5747866):
Displaying 27 items.
- FLINT (Q13059) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Algorithms for the construction of high-order Kronrod rule extensions with application to sparse-grid integration (Q1681770) (← links)
- Drinfeld modules with complex multiplication, Hasse invariants and factoring polynomials over finite fields (Q1994892) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Detecting similarity of rational plane curves (Q2252245) (← links)
- Exterior powers of the adjoint representation and the Weyl ring of \(E_8\) (Q2300484) (← 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)
- Rigorous high-precision computation of the Hurwitz zeta function and its derivatives (Q2351480) (← links)
- Reconstructing rational functions with \texttt{FireFly} (Q2698810) (← links)
- Sato-Tate distributions (Q3295946) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Computing isomorphisms and embeddings of finite fields (Q4612574) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk (Q5145100) (← links)
- Computing level one Hecke eigensystems (mod ) (Q5169603) (← links)
- A fast algorithm for reversion of power series (Q5497035) (← links)
- Algorithm 1021: SPEX Left LU, Exactly Solving Sparse Linear Systems via a Sparse Left-looking Integer-preserving LU Factorization (Q5883713) (← links)
- Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric (Q6116190) (← links)
- Exact hierarchical reductions of dynamical models via linear transformations (Q6121818) (← links)
- Fast norm computation in smooth-degree abelian number fields (Q6142769) (← links)
- Interpolation of dense and sparse rational functions and other improvements in \texttt{FireFly} (Q6161965) (← links)
- Algorithmic counting of nonequivalent compact Huffman codes (Q6631554) (← links)
- msolve. A library for solving polynomial systems (Q6666519) (← links)
- Calcium. Computing in exact real and complex fields (Q6666541) (← links)
