- nondecreasing order
- мат. порядок неубывания
Большой англо-русский и русско-английский словарь. 2001.
nondecreasing order
Смотреть что такое "nondecreasing order" в других словарях:
Dominance order — Example of dominance ordering of partitions of n. Here, n = 6, nodes are partitions of 6, edges indicate that the upper node dominates the lower node. While this particular partial ordering is graded, this is not true for the dominance ordering… … Wikipedia
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Non-uniform rational B-spline — Three dimensional NURBS surfaces can have complex, organic shapes. Control points influence the directions the surface takes. The outermost square below delineates the X/Y extents of the surface … Wikipedia
Beatty sequence — A (homogeneous) Beatty sequence mathcal{B} r, is a sequence formed by successive positive integer multiples of a positive irrational number r, rounded down to the nearest integer, so that the sequence:mathcal{B} r = lfloor r floor, lfloor 2r… … Wikipedia
Complete sequence — In mathematics, an integer sequence is called a complete sequence if every positive integer can be expressed as a sum of values in the sequence, using each value at most once. For example, the sequence of powers of two {1, 2, 4, 8, ...}, based on … 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
Recursive set — In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set. A more… … Wikipedia
Recursive languages and sets — This article is a temporary experiment to see whether it is feasible and desirable to merge the articles Recursive set, Recursive language, Decidable language, Decidable problem and Undecidable problem. Input on how best to do this is very much… … Wikipedia
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
Convex conjugate — In mathematics, convex conjugation is a generalization of the Legendre transformation. It is also known as Legendre–Fenchel transformation or Fenchel transformation (after Adrien Marie Legendre and Werner Fenchel). Contents 1 Definition 2… … Wikipedia
Tournament (graph theory) — Tournament A tournament on 4 vertices Vertices n Edges … Wikipedia
