scientific article; zbMATH DE number 3732172
zbMATH Open0467.12001MaRDI QIDQ3919787FDOQ3919787
Authors: John D. Lipson 
Publication date: 1981
Title of this publication is not available (Why is that?)
GCDfast Fourier transformintegral domainalgebraic computingFFT algorithmeuclidean domaineuclidean algorithmchinese remainder algorithmNewtonian interpolation algorithmPidgin Algol
Numerical mathematical programming methods (65K05) Integral domains (13G05) Research exposition (monographs, survey articles) pertaining to commutative algebra (13-02) Euclidean rings and generalizations (13F07) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Software, source code, etc. for problems pertaining to field theory (12-04) Research exposition (monographs, survey articles) pertaining to field theory (12-02)
Cited In (24)
- Reductions among number theoretic problems
- A refinable space of smooth spline surfaces of arbitrary topological genus
- EXACT SOLUTION OF LINEAR EQUATIONS ON DISTRIBUTED-MEMORY MULTIPROCESSORS
- Buchberger's algorithm: The term rewriter's point of view
- High-radix and bit recoding techniques for modular exponentiation
- The Frobenius problem for numerical semigroups
- Some democratic secret sharing schemes
- Shape characterization of subdivision surfaces -- basic principles
- Computational problems in the theory of finite fields
- Existence and efficient construction of fast Fourier transforms on supersolvable groups
- How to share a secret with cheaters
- Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
- Fast parallel absolute irreducibility testing
- Systolic architectures for polynomial and polynomial matrix manipulations
- Biquadratic G-spline surfaces
- A perfect threshold secret sharing scheme to identify cheaters
- Developing fault-tolerant distributed loops
- A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits
- Parallel radiative transport using a unified matrix approach
- Computing the irreducible real factors and components of an algebraic curve
- A parallel algorithm for exact solution of linear equations via congruence technique
- An improved algorithm for mixed-radix conversion of residue numbers
- Moving regular k-gons in contact
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3919787)
