-
1 approximable
аппроксимируемый finitely approximable group ≈ конечно аппроксимируемая группа finitely approximable semigroup ≈ финитно аппроксимируемая полугруппа locally approximable function ≈ локально аппроксимируемая функция recursively approximable set ≈ рекурсивно аппроксимируемое множество uniformly approximable function ≈ равномерно аппроксимируемая функция - approximable function - approximable operator - finitely approximableБольшой англо-русский и русско-английский словарь > approximable
-
2 approximable
-
3 approximable
-
4 approximable
Математика: аппроксимируемый -
5 approximable
аппроксимируемый, допускающий аппроксимацию -
6 approximable
аппроксимируемый, допускающий аппроксимациюThe New English-Russian Dictionary of Radio-electronics > approximable
-
7 approximable
-
8 approximable function
Большой англо-русский и русско-английский словарь > approximable function
-
9 approximable operator
Большой англо-русский и русско-английский словарь > approximable operator
-
10 approximable function
Математика: аппроксимируемая функция -
11 approximable operator
Математика: аппроксимируемый оператор -
12 finitely approximable
Большой англо-русский и русско-английский словарь > finitely approximable
-
13 finitely approximable
Математика: финитно аппроксимируемый -
14 finitely approximable group
Математика: конечно аппроксимируемая группаУниверсальный англо-русский словарь > finitely approximable group
-
15 finitely approximable semigroup
Математика: финитно аппроксимируемая полугруппаУниверсальный англо-русский словарь > finitely approximable semigroup
-
16 locally approximable function
Математика: локально аппроксимируемая функцияУниверсальный англо-русский словарь > locally approximable function
-
17 recursively approximable set
Математика: рекурсивно аппроксимируемое множествоУниверсальный англо-русский словарь > recursively approximable set
-
18 uniformly approximable function
Математика: равномерно аппроксимируемая функцияУниверсальный англо-русский словарь > uniformly approximable function
-
19 finitely approximable
матем.English-Russian scientific dictionary > finitely approximable
-
20 finitely approximable group
English-Russian scientific dictionary > finitely approximable group
- 1
- 2
См. также в других словарях:
approximable — adjective Able to be approximated … Wiktionary
Dominating set problem — The dominating set problem is an NP complete problem in graph theory.DefinitionAn instance of the dominating set problem consists of: * a graph G with a set V of vertices and a set E of edges, and * a positive integer K smaller than or equal to… … Wikipedia
Probleme de l'ensemble dominant — Problème de l ensemble dominant Le problème d ensemble dominant est un problème NP complet de la théorie des graphes. Sommaire 1 Définition 2 Exemple 3 NP complétude 3.1 Preuve … Wikipédia en Français
Problème de l'ensemble dominant — Le problème d ensemble dominant est un problème NP complet de la théorie des graphes. Sommaire 1 Définition 2 Exemple 3 NP complétude 3.1 Preuve … Wikipédia en Français
Ensemble dominant — En théorie des graphes, un ensemble dominant d un graphe G = ( S, A ) est un sous ensemble D de l ensemble S des sommets tel que tout sommet qui n appartient pas à D possède au moins une arête commune avec un sommet de D. Le problème d ensemble… … Wikipédia en Français
Modulus of continuity — In mathematical analysis, a modulus of continuity is a function used to measure quantitatively the uniform continuity of functions. So, a function admits ω as a modulus of continuity if and only if for all x and y in the domain of f. Since moduli … Wikipedia
A-group — In mathematics, in the area of abstract algebra known as group theory, an A group is a type of group that is similar to abelian groups. The groups were first studied in the 1940s by Philip Hall, and are still studied today. A great deal is known… … Wikipedia
ALGORITHMIQUE — L’objet de l’algorithmique est la conception, l’évaluation et l’optimisation des méthodes de calcul en mathématiques et en informatique. Un algorithme consiste en la spécification d’un schéma de calcul, sous forme d’une suite d’opérations… … Encyclopédie Universelle
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia