- metric problem
- мат. метрическая проблема (геометрии чисел)
Большой англо-русский и русско-английский словарь. 2001.
metric problem
Смотреть что такое "metric problem" в других словарях:
Metric time — is the measure of time interval using the metric system, which defines the second as the base unit of time, and multiple and submultiple units formed with metric prefixes, such as kiloseconds and milliseconds. It does not define the time of day,… … Wikipedia
Metric (mathematics) — In mathematics, a metric or distance function is a function which defines a distance between elements of a set. A set with a metric is called a metric space. A metric induces a topology on a set but not all topologies can be generated by a metric … Wikipedia
Metric expansion of space — Physical cosmology Universe · Big Bang … Wikipedia
Metric space — In mathematics, a metric space is a set where a notion of distance (called a metric) between elements of the set is defined. The metric space which most closely corresponds to our intuitive understanding of space is the 3 dimensional Euclidean… … Wikipedia
Metric k-center — In graph theory, the metric k center, is a combinatorial optimization problem studied in theoretical computer science. Given n cities with specified distances, one wants to build k warehouses in different cities and minimize the distance of the… … Wikipedia
Metric dimension (graph theory) — In graph theory, the metric dimension of a graph G is the minimum number of vertices in a subset S of G such that all other vertices are uniquely determined by their distances to the vertices in S. Finding the metric dimension of a graph is an NP … Wikipedia
Metric tree — This article is about the data structure. For the type of metric space, see Real tree. A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle… … Wikipedia
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
Kepler problem in general relativity — The Kepler problem in general relativity involves solving for the motion of two spherical bodies interacting with one another by gravitation, as described by the theory of general relativity.Typically, and in this article, one body is assumed to… … Wikipedia
Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC … Wikipedia
K-server problem — The k server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are central to the theory of competitive analysis (the other being metrical task systems).… … Wikipedia
