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