Translation for 'approximation' from English to Bulgarian
 NOUN an approximation | approximations SYNO approximation | bringing close together | estimate | ...
 мат. approximation {noun} приближение {ср}
1 translation
To translate another word just start typing!

## Translation for 'approximation' from English to Bulgarian

approximation {noun}
приближение {ср}мат.
Usage Examples English
• The Hosoya index can be efficiently approximated to any desired constant approximation ratio using a fully-polynomial randomized approximation scheme.
• A more general approximation algorithm attains a 2-factor approximation for the weighted case.
• A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error.
• Sometimes there are approximation algorithms to the optimization problem, but, using such an approximation might make the mechanism non-truthful.
• More involved techniques show that there are approximation algorithms with a slightly better approximation factor.

• In mathematics, least squares function approximation applies the principle of least squares to function approximation, by means of a weighted sum of other functions.
• Anomalous diffraction theory (also van de Hulst approximation, eikonal approximation, high energy approximation, soft particle approximation) is an approximation developed by Dutch astronomer van de Hulst describing light scattering for optically soft spheres.
• A simplicial approximation is homotopic to the map it approximates. See simplicial approximation theorem for more details.
• discuss the NP-completeness proof and also present both a constant factor approximation algorithm and polynomial-time approximation scheme to find the clusters in this setting.
• Hardness of approximation theory deals with studying the approximation threshold of such problems.

• The Max-Cut Problem is APX-hard, meaning that there is no polynomial-time approximation scheme (PTAS), arbitrarily close to the optimal solution, for it, unless P = NP.
• There is a polynomial-time approximation algorithm with a logarithmic approximation guarantee, More specifically, a polynomial-time approximation algorithm for domatic partition with the approximation factor [...] for a constant [...] would imply that all problems in NP can be solved in slightly super-polynomial time [...].
• 1 + "&epsilon;" approximation is to find a solution with approximation factor no greater than 1 + "&epsilon;".
• The best approximation known for the general problem achieves an approximation ratio of 2, and is by [...]. This approximation relies heavily on the primal-dual schema of [...].