Pages that link to "Item:Q4124326"
From MaRDI portal
The following pages link to Fast Parallel Matrix Inversion Algorithms (Q4124326):
Displayed 50 items.
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Sparse interpolation of symmetric polynomials (Q678607) (← links)
- On computing the determinant in small parallel time using a small number of processors (Q794429) (← links)
- Minimum energy requirements of information transfer and computing (Q796490) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Generalised characteristic polynomials (Q916718) (← links)
- Parallel solution of linear systems by repeated squaring (Q918127) (← links)
- The unpredictable deviousness of models (Q959796) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- Tensor and border rank of certain classes of matrices and the fast evaluation of determinant, inverse matrix, and eigenvalues (Q1085947) (← links)
- Iterative methods for the parallel solution of linear systems (Q1095580) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- The complexity of elementary algebra and geometry (Q1096620) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- On the VLSI complexity of some arithmetic and numerical problems (Q1103401) (← links)
- A VLSI fast solver for tridiagonal linear systems (Q1108739) (← links)
- The semantics and complexity of parallel programs for vector computations. I: A case study using Ada (Q1110310) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- Techniques for parallel manipulation of sparse matrices (Q1119337) (← links)
- A Monte Carlo method for the parallel solution of linear systems (Q1120249) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Deterministic simulation of tape-bounded probabilistic Turing machine transducers (Q1143792) (← links)
- On uniform circuit complexity (Q1152951) (← links)
- On the complexity of simplifying quadratic forms (Q1157964) (← links)
- On tape-bounded probabilistic Turing machine acceptors (Q1158756) (← links)
- Efficient parallel algorithms for linear recurrence computation (Q1165573) (← links)
- Computing multivariate polynomials in parallel (Q1166928) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination (Q1185457) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Parallel algebraic reductions among numerical problems (Q1190636) (← links)
- A survey of space complexity (Q1193412) (← links)
- On affine scaling algorithms for nonconvex quadratic programming (Q1196182) (← links)
- An improved parallel algorithm for computing the generalized inverse \(A^ +\) (Q1197972) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Parallel direct linear system solvers - a survey (Q1242427) (← links)
- An improved parallel processor bound in fast matrix inversion (Q1244782) (← links)
- A new iterative Monte Carlo approach for inverse matrix problem (Q1298607) (← links)
- On the coefficients of the characteristic polynomial of a matrix (Q1322277) (← links)
- Spectral properties of some matrices close to the Toeplitz triangular form (Q1323624) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- Specified precision polynomial root isolation is in NC (Q1329153) (← links)