The following pages link to (Q3732964):
Displaying 18 items.
- Subtree isomorphism is in random NC (Q922707) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- The inversion of matrices by the double-bordering algorithm on MIMD computers (Q1179259) (← links)
- An improved parallel algorithm for computing the generalized inverse \(A^ +\) (Q1197972) (← links)
- Algorithm-based fault tolerance for matrix inversion with maximum pivoting (Q1200125) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
- A note on parallel matrix inversion (Q2706467) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
- A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calculations (Q3103517) (← links)
- A Space Efficient Flexible Pivot Selection Approach to Evaluate Determinant and Inverse of a Matrix (Q4554864) (← links)
- RNC-approximation algorithms for the steiner problem (Q5048954) (← links)
- Matrix factorizations for reversible integer mapping (Q5353558) (← links)
- Randomized parallel algorithms (Q6560203) (← links)
