scientific article; zbMATH DE number 3090508
From MaRDI portal
Publication:5829318
zbMath0056.35204MaRDI QIDQ5829318
Publication date: 1954
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the numerical condition of polynomials in Bernstein form, The trace invariant and matrix inversion, Feasible arithmetic computations: Valiant's hypothesis, Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications, On the evaluation of some sparse polynomials, On the algorithmic complexity of associative algebras, Fast matrix multiplication and its algebraic neighbourhood, First Study for Ramp Secret Sharing Schemes Through Greatest Common Divisor of Polynomials, Verification complexity of linear prime ideals, Fast modular transforms, Some elementary proofs of lower bounds in complexity theory, Evaluating polynomials at many points, Berechnung und Programm. I, Why does information-based complexity use the real number model?, Rank and optimal computation of generic tensors, Real computations with fake numbers
