scientific article
From MaRDI portal
Publication:3325040
zbMath0538.68035MaRDI QIDQ3325040
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
discrete Fourier transformspolynomial multiplicationmultiplication of univariate n-th degree polynomials
Related Items
Fast computation of elliptic curve isogenies in characteristic two, Relative class number of imaginary Abelian fields of prime conductor below 10000, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, Faster polynomial multiplication via multipoint Kronecker substitution, Polynomial division and its computational complexity, A fast numerical algorithm for the composition of power series with complex coefficients, Sequential and parallel complexity of approximate evaluation of polynomial zeros, On using RSA/ECC coprocessor for ideal lattice-based key exchange, A logarithmic Boolean time algorithm for parallel polynomial division, Cauchy index computation, A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration, Fast evaluation and root finding for polynomials with floating-point coefficients, Nearly optimal refinement of real roots of a univariate polynomial, Fast norm computation in smooth-degree abelian number fields, Modulated string searching, Fast integer multiplication using generalized Fermat primes, A general approach to isolating roots of a bitstream polynomial, Fast inversion of triangular Toeplitz matrices, A fast version of the Schur-Cohn algorithm., Efficient computation of the characteristic polynomial of a threshold graph, From approximate factorization to root isolation with application to cylindrical algebraic decomposition, Irregular primes and cyclotomic invariants to 12 million, On the complexity of computing with planar algebraic curves, Polynomial division with a remainder by means of evaluation and interpolation, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Nearly optimal computations with structured matrices, Faster Pseudopolynomial Time Algorithms for Subset Sum, Computing the irreducible real factors and components of an algebraic curve, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], A note on the power of integer division, Unnamed Item, Unnamed Item, Towards an Implementation of a Computer Algebra System in a Functional Language, On the rapid computation of various polylogarithmic constants, Faster deterministic integer factorization, Variations on computing reciprocals of power series, Quasi-gcd computations
