Matrix inversion in RNC\(^ 1\)

DOI10.1016/0885-064X(91)90037-XzbMath0757.65022MaRDI QIDQ1179457

Mauro Leoncini, Bruno Codenotti

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

matrix inversioncomplexity class \(RNC^ 1\)probabilistic boolean circuits of logarithmic depth

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

Randomization and the parallel solution of linear algebra problems

Cites Work

• Unnamed Item
• Unnamed Item
• On computing the determinant in small parallel time using a small number of processors
• A Monte Carlo method for the parallel solution of linear systems
• Complexity of Solving Linear Systems in Different Models of Computation
• A taxonomy of problems with fast parallel algorithms
• Parallel computation for well-endowed rings and space-bounded probabilistic machines
• Parallel Prefix Computation
• Fast Parallel Matrix Inversion Algorithms
• Fast parallel matrix and GCD computations

This page was built for publication: Matrix inversion in RNC\(^ 1\)