Parallel Algorithms for Algebraic Problems
DOI10.1137/0213050zbMATH Open0553.68032OpenAlexW2049161913MaRDI QIDQ3216142FDOQ3216142
Authors: Joachim von zur Gathen 
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213050
Recommendations
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Circuits for computing the GCD of two polynomials over an algebraic number field
- scientific article; zbMATH DE number 871951
- Fast Parallel Computation of the Polynomial Remainder Sequence via Bézout and Hankel Matrices
- scientific article; zbMATH DE number 17841
Euclidean algorithmparallel processingLas Vegas algorithmsfactorization of polynomialsalgebraic computingFast parallel algorithmsEuclidean schemesquarefree decomposition of polynomials over fieldssymbolic manipulation of univariate polynomials
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials over finite fields (11T06) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials and finite commutative rings (13M10)
Cited In (35)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Parametrization of Newton's iteration for computations with structured matrices and applications
- The enumerability of P collapses P to NC
- Parallel algorithms on greatest common divisor of polynomial system
- Parallel Processing and Applied Mathematics
- Specified precision polynomial root isolation is in NC
- Parallelism and algorithms for algebraic manipulation: current work
- Parallel algorithms for matrix normal forms
- Glushkov's algorithmic algebras and automated parallel computing design
- Title not available (Why is that?)
- Computing primitive elements of extension fields
- Towards massively parallel computations in algebraic geometry
- Inversion in finite fields using logarithmic depth
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Fast and efficient parallel solution of dense linear systems
- Decomposition of algebras over finite fields and number fields
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Subresultants revisited.
- Factoring sparse multivariate polynomials
- Factoring polynomials and primitive elements for special primes
- Very Fast Parallel Polynomial Arithmetic
- Computation of differential Chow forms for ordinary prime differential ideals
- Analysis of Euclidean algorithms for polynomials over finite fields
- Computer algebra: Past and future
- Boolean circuits versus arithmetic circuits
- Parallel approximation of min-max problems
- Functional decomposition of polynomials: the wild case
- Parallel algorithms for some algebraic operations on polynomial equations
- Parallelizable algebras
- Irreducibility of multivariate polynomials
- Functional decomposition of polynomials: the tame case
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- On the complexity of computing the greatest common divisor of several univariate polynomials
- Complexity of parallel matrix computations
- Determining the structure of the Jordan normal form of a matrix by symbolic computation
This page was built for publication: Parallel Algorithms for Algebraic Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216142)
