- monotone ordering
- мат. монотонное упорядочение
Большой англо-русский и русско-английский словарь. 2001.
monotone ordering
Смотреть что такое "monotone ordering" в других словарях:
Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… … Wikipedia
Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… … Wikipedia
Domain theory — is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains. Consequently, domain theory can be considered as a branch of order theory. The field has major applications in computer science,… … Wikipedia
New Foundations — In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled New Foundations for … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids … Wikipedia
Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… … Wikipedia
Order-embedding — In mathematical order theory, an order embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another. Like Galois connections, order embeddings constitute a notion which is strictly… … Wikipedia
Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
