scientific article; zbMATH DE number 3090508
From MaRDI portal
Publication:5829318
zbMATH Open0056.35204MaRDI QIDQ5829318FDOQ5829318
Authors: Alexander Ostrowski 
Publication date: 1954
Title of this publication is not available (Why is that?)
Cited In (17)
- Feasible arithmetic computations: Valiant's hypothesis
- The trace invariant and matrix inversion
- Fast matrix multiplication and its algebraic neighbourhood
- Evaluating polynomials at many points
- Fast modular transforms
- On the algorithmic complexity of associative algebras
- On the numerical condition of polynomials in Bernstein form
- Theoretical computer science: computational complexity
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Berechnung und Programm. I
- Verification complexity of linear prime ideals
- On the evaluation of some sparse polynomials
- Rank and optimal computation of generic tensors
- Why does information-based complexity use the real number model?
- Some elementary proofs of lower bounds in complexity theory
- First study for ramp secret sharing schemes through greatest common divisor of polynomials
- Real computations with fake numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5829318)
