Algebraic Complexity Theory

DOI10.1147/RD.255.0825MaRDI QIDQ3928237zbMATH OpenOpenAlexFDO

Authors 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

algebraic computationsbilinear formsmatrix multiplicationpolynomial multiplication

Mathematics Subject Classification ID

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

Cited in

(4)

• Skew-polynomial-sparse matrix multiplication
• Addition machines, automatic functions and open problems of Floyd and Knuth
• AWE: Adaptive Weight Encoding for Exact Integer Matrix Products with Fewer GEMMs on FP4 Tensor Cores
• Structure and arithmetic complexity of products and inverses of Toeplitz matrices

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)