Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field

DOI10.1007/BF01137457zbMath0658.68044MaRDI QIDQ1111375

P. N. Golovanov, V. I. Solodovnikov

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

complexityparallel computationpolynomials over finite fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06)

Related Items (1)

Efficient and optimal exponentiation in finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• On computing the determinant in small parallel time using a small number of processors
• How to multiply matrices faster
• Upper bounds on the complexity of solving systems of linear equations
• Parallel computations in linear algebra. II
• On the Asymptotic Complexity of Matrix Multiplication
• A Survey of Parallel Algorithms in Numerical Linear Algebra

This page was built for publication: Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field