Parallel Algorithms for Algebraic Problems
algebraic computingEuclidean algorithmEuclidean schemefactorization of polynomialsFast parallel algorithmsLas Vegas algorithmsparallel processingsquarefree decomposition of polynomials over fieldssymbolic manipulation of univariate polynomials
Polynomials over finite fields (11T06) Polynomials in real and complex fields: factorization (12D05) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials and finite commutative rings (13M10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
- 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
- Factoring sparse multivariate polynomials
- Irreducibility of multivariate polynomials
- Factoring polynomials and primitive elements for special primes
- Computer algebra: Past and future
- Complexity of parallel matrix computations
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Specified precision polynomial root isolation is in NC
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Massively parallel factorizations of polynomials with many non-commuting variables
- Subresultants revisited.
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros
- Fast and efficient parallel solution of dense linear systems
- Towards massively parallel computations in algebraic geometry
- The enumerability of P collapses P to NC
- Inversion in finite fields using logarithmic depth
- Boolean circuits versus arithmetic circuits
- Parallel algorithms on greatest common divisor of polynomial system
- Very Fast Parallel Polynomial Arithmetic
- Parallel approximation of min-max problems
- Parallelizable algebras
- Parallelism and algorithms for algebraic manipulation: current work
- scientific article; zbMATH DE number 1254018 (Why is no real title available?)
- scientific article; zbMATH DE number 1254269 (Why is no real title available?)
- scientific article; zbMATH DE number 515222 (Why is no real title available?)
- On the complexity of computing the greatest common divisor of several univariate polynomials
- Parallel Processing and Applied Mathematics
- Glushkov's algorithmic algebras and automated parallel computing design
- Determining the structure of the Jordan normal form of a matrix by symbolic computation
- Decomposition of algebras over finite fields and number fields
- Functional decomposition of polynomials: the tame case
- Functional decomposition of polynomials: the wild case
- Parallel algorithms for matrix normal forms
- Parallel multiplication and powering of polynomials
- Computation of differential Chow forms for ordinary prime differential ideals
- Computing primitive elements of extension fields
- Analysis of Euclidean algorithms for polynomials over finite fields
- Parallel algorithms for some algebraic operations on polynomial equations
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
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)
