Feasible arithmetic computations: Valiant's hypothesis
- 1 October 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 4 (2) , 137-172
- https://doi.org/10.1016/s0747-7171(87)80063-9
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Factoring sparse multivariate polynomialsJournal of Computer and System Sciences, 1985
- Irreducibility of multivariate polynomialsJournal of Computer and System Sciences, 1985
- On computing the determinant in small parallel time using a small number of processorsInformation Processing Letters, 1984
- The complexity of partial derivativesTheoretical Computer Science, 1983
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- Lower bounds for polynomials with algebraic coefficientsTheoretical Computer Science, 1980
- A note on the complexity of algebraic differentationInformation Processing Letters, 1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974