Elements of the general theory of optimal algorithms. Translated from the Ukrainian
From MaRDI portal
Publication:2057553
Recommendations
- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- scientific article; zbMATH DE number 177335
- scientific article; zbMATH DE number 3909615
- scientific article; zbMATH DE number 665283
- Some issues in the theory of optimal algorithms and informational complexity
Cited in
(11)- Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
- scientific article; zbMATH DE number 665283 (Why is no real title available?)
- scientific article; zbMATH DE number 7033647 (Why is no real title available?)
- Approximate calculation of double integrals of highly oscillating functions of general type using the cubature formula of optimal order of accuracy on a class of differentiable functions
- Chebyshev approximation of multivariable functions by a nonlinear function of a rational expression
- Applying the general theory of optimal algorithms in cryptography, steganography, and blockchain technology
- Elements of the general theory of optimal algorithms
- Chebyshev approximation by the power of a rational expression
- The Chebyshev approximation by the logarithm of a rational expression
- Method and algorithm for interbase conversion of Rademacher binary codes into Christensen residue codes
- Chebyshev approximation of multivariable functions by a nonlinear expression of a generalized polynomial with a condition
This page was built for publication: Elements of the general theory of optimal algorithms. Translated from the Ukrainian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2057553)