Area-time tradeoff for rectangular matrix multiplication in VLSI models

DOI10.1016/0020-0190(84)90104-2MaRDI QIDQ796300zbMATH OpenOpenAlexFDO

Authors Grazia Lotti

Publication date 1984

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(84)90104-2

zbMATH Keywords

lower boundmatrix multiplicationarea-time complexityVLSI modelsarea-time tradeoff

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Area-period tradeoffs for multiplication of rectangular matrices
• scientific article; zbMATH DE number 3911707
• Optimal matrix multiplication on fault-tolerant VLSI arrays
• On the Complexity of Matrix Product
• Fast rectangular matrix multiplication and applications

Cites work

• Area-time optimal VLSI networks for multiplying matrices
• Area-time tradeoffs for matrix multiplication and related problems in VLSI models
• The Area-Time Complexity of Binary Multiplication

Cited in

(6)

• scientific article; zbMATH DE number 3890726 (Why is no real title available?)
• Area-period tradeoffs for multiplication of rectangular matrices
• The matrix equation MX + XN = B in the VLSI model
• Area—Time optimal VLSI integer multiplier with minimum computation time
• Area-time tradeoffs for bilinear forms computations in VLSI
• Area-time complexity of the unconstrained minimization problem

This page was built for publication: Area-time tradeoff for rectangular matrix multiplication in VLSI models

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