The following pages link to (Q5829318):
Displaying 17 items.
- Rank and optimal computation of generic tensors (Q1051066) (← links)
- On the numerical condition of polynomials in Bernstein form (Q1098225) (← links)
- The trace invariant and matrix inversion (Q1105373) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- Verification complexity of linear prime ideals (Q1207526) (← links)
- Fast modular transforms (Q1216049) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Evaluating polynomials at many points (Q2549230) (← links)
- Berechnung und Programm. I (Q2557558) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials (Q3300516) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
