scientific article; zbMATH DE number 3992807
From MaRDI portal
Publication:4720685
Recommendations
Cited in
(6)- Computing partial information out of intractable: powers of algebraic numbers as an example
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- How much faster does the best polynomial approximation converge than Legendre projection?
- Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
- When Close Enough is Close Enough
- Parameters recovering algorithm for one class of irrationalities
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 Q4720685)