Inversion in finite fields using logarithmic depth
- 28 February 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 9 (2) , 175-183
- https://doi.org/10.1016/s0747-7171(08)80028-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Very Fast Parallel Polynomial ArithmeticSIAM Journal on Computing, 1989
- The parallel complexity of exponentiating polynomials over finite fieldsJournal of the ACM, 1988
- Computing Powers in ParallelSIAM Journal on Computing, 1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Polynomial division and its computational complexityJournal of Complexity, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982