Pages that link to "Item:Q1100892"

The following pages link to Complexity of parallel matrix computations (Q1100892):

Displaying 24 items.

• Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
• Parallel algorithms for matrix polynomial division (Q805151) (← links)
• Parallel solution of linear systems by repeated squaring (Q918127) (← links)
• Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
• Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
• Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
• Matrix structures in parallel matrix computations (Q1122309) (← links)
• Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
• Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
• Specified precision polynomial root isolation is in NC (Q1329153) (← 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)
• Parallel algorithms for certain matrix computations (Q1390874) (← links)
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
• Successive matrix squaring algorithm for computing the Drazin inverse (Q1569158) (← 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)
• (Q4327513) (← links)
• (Q4463249) (← links)
• Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses (Q4665363) (← links)
• Work-Preserving Speed-Up of Parallel Matrix Computations (Q4852625) (← links)
• On polynomial ideals, their complexity, and applications (Q5055880) (← links)
• Membership in polynomial ideals over Q is exponential space complete (Q5096173) (← links)