Algebraic Complexity Theory

DOI10.1147/RD.255.0825zbMATH Open0473.68029OpenAlexW1994289991MaRDI QIDQ3928237FDOQ3928237

Nicholas Pippenger

Publication date: 1981

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/618

zbMATH Keywords

bilinear formsmatrix multiplicationpolynomial multiplicationalgebraic computations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Cited In (3)

• Skew-polynomial-sparse matrix multiplication
• Structure and arithmetic complexity of products and inverses of Toeplitz matrices
• Addition machines, automatic functions and open problems of Floyd and Knuth

This page was built for publication: Algebraic Complexity Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3928237)