On the VLSI complexity of some arithmetic and numerical problems

DOI10.1007/BF02575818zbMath0645.68058OpenAlexW1980053390MaRDI QIDQ1103401

Bruno Codenotti

Publication date: 1987

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575818

zbMATH Keywords

complexity measuresnumerical computationsVLSI model of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
• Area-time lower-bound techniques with applications to sorting
• Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
• A VLSI fast solver for tridiagonal linear systems
• Area-time optimal VLSI networks for multiplying matrices
• The complexity of a VLSI adder
• Systolic Networks for Orthogonal Decompositions
• Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
• The VLSI Complexity of Selected Graph Problems
• The Area-Time Complexity of Binary Multiplication
• Parallel Tridiagonal Equation Solvers
• Fast Parallel Matrix Inversion Algorithms

This page was built for publication: On the VLSI complexity of some arithmetic and numerical problems