Pages that link to "Item:Q4745254"
From MaRDI portal
The following pages link to Fast parallel matrix and GCD computations (Q4745254):
Displaying 50 items.
- Formalisation of the computation of the echelon form of a matrix in Isabelle/HOL (Q333325) (← links)
- On parallel complexity of analytic functions (Q388112) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Accurate approximate diagnosis of (controllable) stochastic systems (Q832093) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Problems complete for \(\oplus L\) (Q918696) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- Factoring sparse multivariate polynomials (Q1080656) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- The complexity of elementary algebra and geometry (Q1096620) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems (Q1106934) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- A systolic algorithm for extended GCD computation (Q1110555) (← links)
- Parallel algorithms for solvable permutation groups (Q1111023) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- The iterated mod problem (Q1119390) (← links)
- Matrix structures in parallel matrix computations (Q1122309) (← 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 evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Parallel algebraic reductions among numerical problems (Q1190636) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- NC algorithms for real algebraic numbers (Q1201334) (← links)
- Computing the inertia of Bézout and Hankel matrices (Q1201962) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets (Q1276171) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← 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)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
