- problem of comparability
- проблема сопоставимости ;
Англо-Русский словарь финансовых терминов. 2000.
problem of comparability
Смотреть что такое "problem of comparability" в других словарях:
Comparability graph — In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable… … 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
Non-simultaneity — Part of a series on Marxism … Wikipedia
accounting — /euh kown ting/, n. 1. the theory and system of setting up, maintaining, and auditing the books of a firm; art of analyzing the financial position and operating results of a business house from a study of its sales, purchases, overhead, etc.… … Universalium
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Modular decomposition — In graph theory, the modular decomposition is a decomposition of an undirected graph into subsets of vertices called modules. A module is a generalization of a connected component of a graph. Unlike connected components, however, one module can… … Wikipedia
Interval graph — In graph theory, an interval graph is the intersection graph of a set of intervals on the real line. It has one vertex for each interval in the set, and an edge between every pair of vertices corresponding to intervals that intersect.Formally,… … Wikipedia
Order dimension — A partial order of dimension 4 (shown as a Hasse diagram) and four total orderings that form a realizer for this partial order. In mathematics, the dimension of a partially ordered set (poset) is the smallest number of total orders the… … Wikipedia
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Unemployment — World unemployment rates[1] as of January 2009[update] Unemployment (or … Wikipedia
Social choice theory — is a theoretical framework for measuring individual interests, values, or welfares as an aggregate towards collective decision. A non theoretical example of a collective decision is passing a set of laws under a constitution. Social choice theory … Wikipedia
