Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field
From MaRDI portal
Publication:1111375
DOI10.1007/BF01137457zbMath0658.68044MaRDI QIDQ1111375
P. N. Golovanov, V. I. Solodovnikov
Publication date: 1987
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items (1)
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