Inverting a Vandermonde matrix in minimum parallel time

https://doi.org/10.1016/0020-0190(91)90084-UGet rights and content

First page preview

First page preview
Click to open first page preview

References (10)

  • A. Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • G. Bilardi et al.

    Size-time complexity of boolean networks for prefix computations

    J. ACM

    (1989)
  • L.I. Bluestein

    A linear filtering approach to the computation of discrete Fourier transform

    IEEE Trans. Audio & Electroacoustics

    (1970)
  • W. Eberly

    Very fast parallel matrix and polynomial arithmetic

    Proc. 25th IEEE Symp. FOCS

    (1984)
  • G.H. Golub 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 Science
  • A note on Bernstein-Vandermonde matrices

    2020, Linear and Multilinear Algebra
  • The 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)
View all citing articles on Scopus

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.

View full text