scientific article; zbMATH DE number 4057005

MaRDI QIDQ3792241zbMATH OpenFDO

Authors Imrich Vrt'o

Publication date 1988

zbMATH Keywords

chip arealower boundstriangular linear systemVLSI

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3915623
• Area—Time optimal VLSI integer multiplier with minimum computation time
• scientific article; zbMATH DE number 3887073
• On the VLSI complexity of some arithmetic and numerical problems
• scientific article; zbMATH DE number 3889515
• A model of computation for VLSI with related complexity results
• Hardware Complexity of Modular Multiplication and Exponentiation
• scientific article; zbMATH DE number 19782
• Arithmetic complexity in ring extensions
• On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication

Cited in

(6)

• Area-period tradeoffs for multiplication of rectangular matrices
• Area—Time optimal VLSI integer multiplier with minimum computation time
• Optimal Allocation of Area for Single-Chip Computations
• scientific article; zbMATH DE number 3922543 (Why is no real title available?)
• scientific article; zbMATH DE number 2172639 (Why is no real title available?)
• The area-time complexity of the greatest common divisor problem: A lower bound

This page was built for publication:

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