scientific article

zbMath0467.12001MaRDI QIDQ3919787

John D. Lipson

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

GCDfast Fourier transformalgebraic computingintegral domainFFT algorithmeuclidean domaineuclidean algorithmchinese remainder algorithmNewtonian interpolation algorithmPidgin Algol

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Integral domains (13G05) Euclidean rings and generalizations (13F07) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02) Software, source code, etc. for problems pertaining to field theory (12-04) Research exposition (monographs, survey articles) pertaining to field theory (12-02)

Related Items (24)

Fast parallel absolute irreducibility testing ⋮ Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) ⋮ Reductions among number theoretic problems ⋮ Some democratic secret sharing schemes ⋮ Buchberger's algorithm: The term rewriter's point of view ⋮ High-radix and bit recoding techniques for modular exponentiation ⋮ Shape characterization of subdivision surfaces -- basic principles ⋮ EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS ⋮ A refinable space of smooth spline surfaces of arbitrary topological genus ⋮ How to share a secret with cheaters ⋮ Parallel radiative transport using a unified matrix approach ⋮ Moving regular k-gons in contact ⋮ Developing fault-tolerant distributed loops ⋮ Systolic architectures for polynomial and polynomial matrix manipulations ⋮ The Frobenius problem for numerical semigroups ⋮ Computational problems in the theory of finite fields ⋮ Biquadratic G-spline surfaces ⋮ Existence and efficient construction of fast Fourier transforms on supersolvable groups ⋮ A parallel algorithm for exact solution of linear equations via congruence technique ⋮ A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits ⋮ A perfect threshold secret sharing scheme to identify cheaters ⋮ Computing the irreducible real factors and components of an algebraic curve ⋮ An improved algorithm for mixed-radix conversion of residue numbers ⋮ Applying fault-tolerant solutions of circulant graphs to multidimensional meshes

This page was built for publication: