Boolean circuits versus arithmetic circuits
- 1 March 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 91 (1) , 142-154
- https://doi.org/10.1016/0890-5401(91)90078-g
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Inversion in finite fields using logarithmic depthJournal of Symbolic Computation, 1990
- 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
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- On the power of straight- line computations in finite fieldsIEEE Transactions on Information Theory, 1982
- Fast parallel matrix and GCD computationsInformation and Control, 1982