Inverting a Vandermonde matrix in minimum parallel time☆
References (10)
- et al.
The Design and Analysis of Computer Algorithms
(1974) - et al.
Size-time complexity of boolean networks for prefix computations
J. ACM
(1989) A linear filtering approach to the computation of discrete Fourier transform
IEEE Trans. Audio & Electroacoustics
(1970)Very fast parallel matrix and polynomial arithmetic
Proc. 25th IEEE Symp. FOCS
(1984)- et al.
Matrix Computations
(1989)
There are more references available in the full text version of this article.
Cited by (7)
The enumerability of P collapses P to NC
2005, Theoretical Computer ScienceResolution of Hartmanis' conjecture for NL-hard sparse sets
2000, Theoretical Computer ScienceGeneralised matrix inversion and rank computation by successive matrix powering
1994, Parallel ComputingA note on Bernstein-Vandermonde matrices
2020, Linear and Multilinear AlgebraThe enumerability of P collapses P to NC
2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Resolution of Hartmanis’ conjecture for NL-hard sparse sets
1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
This work was supported in part by the National Science Foundation Grant CCR-89-11941. This research was initiated while the author was with the Coordinated Science Laboratory, University of Illinois, Urbana, IL 61801, USA.
Copyright © 1991 Published by Elsevier B.V.