DOI10.1137/0213050zbMath0553.68032OpenAlexW2049161913MaRDI QIDQ3216142
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
Specified precision polynomial root isolation is in NC,
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,
Inversion in finite fields using logarithmic depth,
Boolean circuits versus arithmetic circuits,
Parallel computation of polynomial GCD and some related parallel computations over abstract fields,
Parallel approximation of min-max problems,
On the complexity of computing the greatest common divisor of several univariate polynomials,
Computation of differential Chow forms for ordinary prime differential ideals,
Subresultants revisited.,
Computing primitive elements of extension fields,
Analysis of Euclidean algorithms for polynomials over finite fields,
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators,
On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields,
Determining the structure of the Jordan normal form of a matrix by symbolic computation,
Decomposition of algebras over finite fields and number fields,
Parametrization of Newton's iteration for computations with structured matrices and applications,
Functional decomposition of polynomials: the tame case,
Functional decomposition of polynomials: the wild case,
Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros,
Fast and efficient parallel solution of dense linear systems,
The enumerability of P collapses P to NC,
Parallel algorithms for matrix normal forms
