scientific article; zbMATH DE number 3090508
From MaRDI portal
Publication:5829318
Cited in
(17)- Verification complexity of linear prime ideals
- Rank and optimal computation of generic tensors
- First study for ramp secret sharing schemes through greatest common divisor of polynomials
- Theoretical computer science: computational complexity
- Fast modular transforms
- The trace invariant and matrix inversion
- Why does information-based complexity use the real number model?
- Berechnung und Programm. I
- On the algorithmic complexity of associative algebras
- On the evaluation of some sparse polynomials
- Feasible arithmetic computations: Valiant's hypothesis
- Evaluating polynomials at many points
- On the numerical condition of polynomials in Bernstein form
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications
- Real computations with fake numbers
- Fast matrix multiplication and its algebraic neighbourhood
- Some elementary proofs of lower bounds in complexity theory
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)
