scientific article
From MaRDI portal
Publication:3615926
zbMath1208.68239MaRDI QIDQ3615926
Publication date: 24 March 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Computation of special functions and constants, construction of tables (65D20) Numerical methods for discrete and fast Fourier transforms (65T50) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity and performance of numerical algorithms (65Y20)
Related Items
A search for Wilson primes ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Partial Key Exposure Attack on CRT-RSA ⋮ Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications ⋮ Efficient Generic Quotients Using Exact Arithmetic ⋮ Fast norm computation in smooth-degree abelian number fields ⋮ On the computation of the HNF of a module over the ring of integers of a number field ⋮ Counting points on hyperelliptic curves in average polynomial time ⋮ Point counting in families of hyperelliptic curves ⋮ Primality testing with Gaussian periods ⋮ List Decoding for Binary Goppa Codes ⋮ ECM using Edwards curves ⋮ Faster algorithms for the square root and reciprocal of power series ⋮ Wild McEliece ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes ⋮ Short addition sequences for theta functions ⋮ A fast algorithm for reversion of power series ⋮ Linear differential equations as a data structure ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modular exponentiation via the explicit Chinese remainder theorem ⋮ Computing Igusa class polynomials ⋮ Rigorous high-precision computation of the Hurwitz zeta function and its derivatives
