scientific article
From MaRDI portal
Publication:3732964
zbMath0598.68042MaRDI QIDQ3732964
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Iterative numerical methods for linear systems (65F10)
Related Items
RNC-approximation algorithms for the steiner problem, Complexity of parallel matrix computations, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, Algebraic and numerical techniques for the computation of matrix determinants, NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems, Optimal and nearly optimal algorithms for approximating polynomial zeros, Subtree isomorphism is in random NC, Fast and efficient linear programming and linear least-squares computations, Efficient parallel factorization and solution of structured and unstructured linear systems, Fast and efficient parallel solution of dense linear systems
