@Article{ 76cb2378-eaf4-38cb-a395-1c705ffee385,
Author = "Pan, Victor",
Abstract = "This paper reviews the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms.",
date-added = "2023-09-21 08:16:28 +0200",
date-modified = "2023-09-21 08:16:28 +0200",
ISSN = "00361445",
Journal = "SIAM Review",
Number = "2",
Pages = "225--262",
Publisher = "Society for Industrial and Applied Mathematics",
Title = "Complexity of Computations with Matrices and Polynomials",
URL = "http://www.jstor.org/stable/2132854",
URLDate = "2023-09-21",
Volume = "34",
Year = "1992",
bdsk-url-1 = "http://www.jstor.org/stable/2132854",
File = "Complexity of Computations with Matrices and Polynomials - 10.2307@2132854.pdf"
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A