On the VLSI complexity of some arithmetic and numerical problems
From MaRDI portal
We present a survey of complexity results which arise in VLSI theory, when dealing with numerical computations. The VLSI model of computation is briefly described, and the corresponding complexity measures are presented. VLSI designs for the solution of some important arithmetic and numerical problems are also shown.
Recommendations
Cites work
- A VLSI fast solver for tridiagonal linear systems
- Area-time lower-bound techniques with applications to sorting
- Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\)
- Area-time optimal VLSI networks for multiplying matrices
- Fast Parallel Matrix Inversion Algorithms
- scientific article; zbMATH DE number 3847304 (Why is no real title available?)
- scientific article; zbMATH DE number 3858396 (Why is no real title available?)
- Numerically Stable Solution of Dense Systems of Linear Equations Using Mesh-Connected Processors
- Parallel Tridiagonal Equation Solvers
- Systolic Networks for Orthogonal Decompositions
- The Area-Time Complexity of Binary Multiplication
- The complexity of a VLSI adder
- The VLSI Complexity of Selected Graph Problems
- VLSI implementation of fast solvers for band linear systems with constant coefficient matrix
Cited in
(5)- The applicability of discrete performance estimation methods to VLSI design
- scientific article; zbMATH DE number 3869221 (Why is no real title available?)
- scientific article; zbMATH DE number 3922543 (Why is no real title available?)
- scientific article; zbMATH DE number 4051518 (Why is no real title available?)
- scientific article; zbMATH DE number 4057005 (Why is no real title available?)
This page was built for publication: On the VLSI complexity of some arithmetic and numerical problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103401)
