scientific article; zbMATH DE number 3965444
From MaRDI portal
Publication:3732964
Recommendations
Cited in
(24)- A \(p\)-adic algorithm for computing the inverse of integer matrices
- Complexity of parallel matrix computations
- Parallel evaluation of the determinant and of the inverse of a matrix
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- The inversion of matrices by the double-bordering algorithm on MIMD computers
- An improved parallel algorithm for computing the generalized inverse A^ +
- Algorithm-based fault tolerance for matrix inversion with maximum pivoting
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Algebraic and numerical techniques for the computation of matrix determinants
- Fast and efficient parallel solution of dense linear systems
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- Efficient parallel factorization and solution of structured and unstructured linear systems
- A note on parallel matrix inversion
- Fast and efficient linear programming and linear least-squares computations
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations
- scientific article; zbMATH DE number 4088832 (Why is no real title available?)
- scientific article; zbMATH DE number 1254019 (Why is no real title available?)
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix
- RNC-approximation algorithms for the steiner problem
- Matrix factorizations for reversible integer mapping
- The role of arithmetic in fast parallel matrix inversion
- Randomized parallel algorithms
- On the complexity of inverting integer and polynomial matrices
- Subtree isomorphism is in random NC
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 Q3732964)
