Preface

Authors:
Dario Andrea Bini;Victor Y. Pan;Jan Verschelde
Affiliations:
Dipartimento di Matematica, Universitá di Pisa, Largo Bruno Pontecorvo, 5 56127 Pisa, Italy;Department of Mathematics and Computer Science, Lehman College of the City University of New York, Bronx, NY 10468, USA;University of Illinois at Chicago, (Mail Code 249), Chicago, IL, 60607-7045, USA
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 1

Complexity of computations with matrices and polynomials

SIAM Review
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
Solving a Polynomial Equation: Some History and Recent Progress

SIAM Review
Structured matrices and polynomials: unified superfast algorithms

Structured matrices and polynomials: unified superfast algorithms
Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)

Numerical Methods for Structured Markov Chains (Numerical Mathematics and Scientific Computation)
Hybrid symbolic-numeric computation

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Randomized preconditioning of the MBA algorithm

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	5.23

Visualization

Abstract