Pages that link to "Item:Q3216142"
From MaRDI portal
The following pages link to Parallel Algorithms for Algebraic Problems (Q3216142):
Displaying 33 items.
- Parallel approximation of min-max problems (Q354658) (← links)
- Determining the structure of the Jordan normal form of a matrix by symbolic computation (Q676030) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- Functional decomposition of polynomials: the wild case (Q755793) (← links)
- Parallel algorithms for matrix normal forms (Q803724) (← links)
- Computation of differential Chow forms for ordinary prime differential ideals (Q895970) (← links)
- Computing primitive elements of extension fields (Q911775) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Parallel algorithms for some algebraic operations on polynomial equations (Q921855) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Subresultants revisited. (Q1401299) (← links)
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Towards massively parallel computations in algebraic geometry (Q2040457) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- Parallelizable algebras (Q3773330) (← links)
- Parallelism and algorithms for algebraic manipulation: current work (Q3802602) (← links)
- (Q4282847) (← links)
- On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342) (← links)
- Parallel Processing and Applied Mathematics (Q5307438) (← links)
- Glushkov's algorithmic algebras and automated parallel computing design (Q6066027) (← links)
