The following pages link to Bruno Codenotti (Q918126):
Displayed 50 items.
- Item:Q918126 (redirect page) (← links)
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems (Q579837) (← links)
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- Parallel solution of linear systems by repeated squaring (Q918127) (← links)
- An optimal multiprocessor combinatorial auction solver (Q947953) (← links)
- The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
- Approximation algorithms for a hierarchically structured bin packing problem (Q1029084) (← links)
- On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
- VLSI implementation of fast solvers for band linear systems with constant coefficient matrix (Q1075016) (← links)
- Area-time tradeoffs for bilinear forms computations in VLSI (Q1087015) (← links)
- Area-time complexity of the unconstrained minimization problem (Q1087137) (← links)
- Fast parallel algorithms for matrix inversion and linear systems solution (Q1092603) (← links)
- New techniques for the solution of linear systems by iterative methods (Q1094091) (← links)
- Low rank modifications of Jacobi and JOR iterative methods (Q1095579) (← links)
- Iterative methods for the parallel solution of linear systems (Q1095580) (← links)
- On the VLSI complexity of some arithmetic and numerical problems (Q1103401) (← links)
- Parallel solution of block tridiagonal linear systems (Q1106615) (← links)
- A VLSI fast solver for tridiagonal linear systems (Q1108739) (← links)
- The bit-cost of some algorithms for the solution of linear systems (Q1108740) (← links)
- Matrix-vector multiplication: Parallel algorithms and architectures (Q1114309) (← links)
- A Monte Carlo method for the parallel solution of linear systems (Q1120249) (← links)
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- How fast can one compute the permanent of circulant matrices? (Q1124882) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- Parallel algebraic reductions among numerical problems (Q1190636) (← links)
- Traveling salesman problem and local search (Q1195657) (← links)
- Error analysis of two algorithms for the computation of the matrix exponential (Q1207776) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- Algebraic techniques in communication complexity (Q1350289) (← links)
- On the permanent of certain \((0,1)\) Toeplitz matrices (Q1373310) (← links)
- Parallel algorithms for certain matrix computations (Q1390874) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- Computation of sparse circulant permanents via determinants (Q1855364) (← links)
- A fast and stable parallel QR algorithm for symmetric tridiagonal matrices (Q1893081) (← links)
- Checking robust nonsingularity of tridiagonal matrices in linear time (Q1914863) (← links)
- The Padé method for computing the matrix exponential (Q1915610) (← links)
- Matrix rigidity (Q1970501) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
- (Q2704232) (← links)
- (Q2921655) (← links)
- (Q3028201) (← links)
- (Q3524715) (← links)
- Market equilibrium via the excess demand function (Q3581416) (← links)
- Leontief economies encode nonzero sum two-player games (Q3581585) (← links)
- Computing Equilibrium Prices in Exchange Economies with Tax Distortions (Q3613792) (← links)
- The matrix equation MX + XN = B in the VLSI model (Q3799562) (← links)
- A fast algorithm for the division of two polynomial matrices (Q3816909) (← links)
- (Q3826004) (← links)