- lexicographic extension
- мат. лексикографическое расширение
Большой англо-русский и русско-английский словарь. 2001.
lexicographic extension
Смотреть что такое "lexicographic extension" в других словарях:
On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( … Wikipedia
WordNet — is a lexical database for the English language.[1] It groups English words into sets of synonyms called synsets, provides short, general definitions, and records the various semantic relations between these synonym sets. The purpose is twofold:… … Wikipedia
Radical (Chinese character) — Bushu redirects here. For the former Japanese province, see Musashi Province. The Chinese character 採 cǎi, meaning ‘to pick’, with its ‘root’, the original, semantic (meaning bearing) graph on the right, colored red; and its later added,… … Wikipedia
Goal programming — is a branch of multiobjective optimization, which in turn is a branch of multi criteria decision analysis (MCDA), also known as multiple criteria decision making (MCDM). It can be thought of as an extension or generalisation of linear programming … Wikipedia
Cyclically ordered group — In mathematics, a cyclically ordered group is a set with both a group structure and a cyclic order, such that left and right multiplication both preserve the cyclic order. Cyclically ordered groups were first studied in depth by Ladislav Rieger… … 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
Counterexamples in Topology — Author(s) Lynn Arthur Steen J. Ar … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
North America — North American. the northern continent of the Western Hemisphere, extending from Central America to the Arctic Ocean. Highest point, Mt. McKinley, 20,300 ft. (6187 m); lowest, Death Valley, 276 ft. (84 m) below sea level. 400,000,000 including… … Universalium
Radix tree — In computer science, a radix tree (also patricia trie or radix trie) is a space optimized trie data structure where each node with only one child is merged with its child. The result is that every internal node has at least two children. Unlike… … Wikipedia
