The following pages link to (Q4190138):
Displaying 50 items.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- A multiprecise integer arithmetic package (Q547494) (← links)
- A class of algorithms which require nonlinear time to maintain disjoint sets (Q598809) (← links)
- Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568) (← links)
- A backward automatic differentiation framework for reservoir simulation (Q723155) (← links)
- Planar acyclic computation (Q751805) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- On the algebraic complexity of rational iteration procedures (Q811125) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Fast evaluation and interpolation at the Chebyshev sets of points (Q918113) (← links)
- Rank and optimal computation of generic tensors (Q1051066) (← links)
- Upper bounds on the complexity of solving systems of linear equations (Q1057647) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Fast algorithms for the characteristic polynomial (Q1058849) (← links)
- Typical tensorial rank (Q1064383) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
- Improved lower bounds for some matrix multiplication problems (Q1068534) (← links)
- The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
- The complexity of evaluating interpolation polynomials (Q1081273) (← links)
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Time-space efficient algorithms for computing convolutions and related problems (Q1098288) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- On the worst-case arithmetic complexity of approximating zeros of polynomials (Q1101184) (← links)
- A fast algorithm for the discrete Laplace transformation (Q1104064) (← links)
- The trace invariant and matrix inversion (Q1105373) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- Size-depth tradeoff in non-monotone Boolean formulae (Q1132635) (← links)
- Stability of fast algorithms for matrix multiplication (Q1138347) (← links)
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits (Q1140426) (← links)
- Multiplicative complexity of some rational functions (Q1141478) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- On the complexity of computing bilinear forms with \(\{0,1\}\) constants (Q1144927) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- On the control of structural models (Q1149411) (← links)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- On efficient computation of the coefficients of some polynomials with applications to some enumeration problems (Q1152953) (← links)
- Relation between rank and multiplicative complexity of a bilinear form over a commutative Noetherian ring (Q1153191) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- How many polynomials can be approximated faster than they can be evaluated? (Q1155959) (← links)
