- necessarily unique
- мат. необходимо единственный
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Unique bid auction — A unique bid auction is a type of strategy game related to traditional auctions where the winner is usually the individual with the lowest unique bid, although less commonly the auction rules may specify that the highest unique bid is the winner … Wikipedia
Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… … Wikipedia
Mode (statistics) — In statistics, the mode is the value that occurs most frequently in a data set or a probability distribution.[1] In some fields, notably education, sample data are often called scores, and the sample mode is known as the modal score.[2] Like the… … 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
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Mathematical constant — A mathematical constant is a special number, usually a real number, that is significantly interesting in some way .[1] Constants arise in many different areas of mathematics, with constants such as e and π occurring in such diverse contexts as… … Wikipedia
Fibre Channel — Layer 4. Protocol mapping LUN masking Layer 3. Common services Layer 2. Network Fibre Channel fabric … Wikipedia
Decoding methods — In communication theory and coding theory, decoding is the process of translating received messages into codewords of a given code. There has been many common methods of mapping messages to codewords. These are often used to recover messages sent … Wikipedia
Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… … Wikipedia
Greatest common divisor of two polynomials — Informally, the greatest common divisor (GCD) of two polynomials p ( x ) and q ( x ) is the biggest polynomial that divides evenly into both p ( x ) and q ( x ). The definition is modeled on the concept of the greatest common divisor of two… … Wikipedia
Linguistic relativity and the color naming debate — Linguistic relativity stems from a question about the relationship between language and thought, about whether one s language determines the way one thinks. This question has given birth to a wide array of research within a variety of different… … Wikipedia