You searched for: approximation (Portugisiska - Engelska)

chapter 35: approximation algorithms, pp.
chapter 35: approximation algorithms, pp.

optimization, approximation and complexity classes.
optimization, approximation and complexity classes.

020403 standardisation and approximation of legislation
020403 normalisation et rapprochement des législations

"approximation theorems of mathematical statistics".
"approximation theorems of mathematical statistics".

this is a consequence of the born-oppenheimer approximation.
this is a consequence of the born–oppenheimer approximation.

"journal of approximation theory", 65(1):ii.
theory 65 (1) (1991), i; 1-2.

"approximation algorithms for np-hard problems, pws publishing company, 1997.
"approximation algorithms for np-hard problems", pws publishing company, 1997.

a new method of solving numerical equations of all orders, by continuous approximation.
the advocacy, as well as the detraction, of horner's method has this as an unspoken subtext.

he found the optimal order of approximation for some methods of solution of variational inequalities.
he found the optimal order of approximation for some methods of solution of variational inequalities.

the approximation becomes more exact as the number of environmental degrees of freedom affected increases.
the approximation becomes more exact as the number of environmental degrees of freedom affected increases.

)* schmidt, wolfgang m. (1980 with minor corrections) "diophantine approximation.
)* schmidt, wolfgang m. (1980 with minor corrections) "diophantine approximation.

juni 1973 im mathematischen forschungsinstitut oberwolfach, stuttgart 1975*"approximationstheorie: tschebyscheffsche approximation und anwendungen.
juni 1973 im mathematischen forschungsinstitut oberwolfach, stuttgart 1975* "approximationstheorie: tschebyscheffsche approximation und anwendungen.

*#approximation error: is the error due to the replacement of an exact problem by an approximating one.
#approximation error: is the error due to the replacement of an exact problem by an approximating one.

his work on the problem of characterising the representable functors in the category of schemes has led to the artin approximation theorem, in local algebra.
his work on the problem of characterising the representable functors in the category of schemes has led to the artin approximation theorem, in local algebra.

* kwapień, s. "on enflo's example of a banach space without the approximation property".
* kwapień, s. "on enflo's example of a banach space without the approximation property".

==aproximações==the best polynomial time approximation algorithm known for this case achieves only a very weak approximation ratio, formula_1.
==approximation==the best polynomial time approximation algorithm known for this case achieves only a very weak approximation ratio, formula_1.

both "a priori" and "a posteriori" estimates of the errors concerning the approximation given by these methods are proved.
both "a priori" and "a posteriori" estimates of the errors concerning the approximation given by these methods are proved.

mikhlin studied the completeness of the coordinate functions used in this methods in the sobolev space formula_16, deriving the order of approximation as a function of the smoothness properties of the functions to be approximation of functions approximated.
mikhlin studied the completeness of the coordinate functions used in this methods in the sobolev space }, deriving the order of approximation as a function of the smoothness properties of the functions to be approximation of functions approximated.

he developed the helicity formulation for collisions between particles with arbitrary spin, worked with geoffrey chew on the impulse approximation, and worked on meson theory, symmetry principles in physics, and the vacuum structure of quantum field theory.
he also introduced the wick rotation, in which computations are analytically continued from minkowski space to four-dimensional euclidean space using a coordinate change to imaginary time he developed the helicity formulation for collisions between particles with arbitrary spin, worked with geoffrey chew on the impulse approximation, and worked on meson theory, symmetry principles in physics, and the vacuum structure of quantum field theory.

he also characterized the class of coordinate functions which give the best order of approximation, and has studied the stability of the variational-difference process and the growth of the condition number of the variation-difference matrix.
he also characterized the class of coordinate functions which give the best order of approximation, and has studied the stability of the variational-difference process and the growth of the condition number of the variation-difference matrix.