cyclic ordering
- мат. цикличное упорядочение
Большой англо-русский и русско-английский словарь. 2001.
Смотреть что такое "cyclic ordering" в других словарях:
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
Cyclic redundancy check — A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… … Wikipedia
Cyclic cellular automaton — A one dimensional cyclic cellular automaton with n = 4, run for 300 steps from a random initial configuration. The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton … Wikipedia
Flexible Macroblock Ordering — H.264/MPEG 4 AVC is a new standard for digital video compression jointly developed by ITU T’s Video Coding Experts Group (VCEG) and ISO/IEC’s Moving Picture Experts Group (MPEG).Next to efficient coding algorithms, the H.264/AVC specifications… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial … Wikipedia
Permutation — For other uses, see Permutation (disambiguation). The 6 permutations of 3 balls In mathematics, the notion of permutation is used with several slightly different meanings, all related to the act of permuting (rearranging) objects or values.… … Wikipedia
Integer — This article is about the mathematical concept. For integers in computer science, see Integer (computer science). Symbol often used to denote the set of integers The integers (from the Latin integer, literally untouched , hence whole : the word… … Wikipedia
Conway polynomial (finite fields) — In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define a standard representation of Fpn as a splitting field of Fp. Conway polynomials were named… … Wikipedia
Книги
- Axioms and Hulls, Donald E. Knuth, One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an… Категория: Компьютерные технологии Подробнее Купить за 10127 руб
- What we know about the Islamic Financial System Procyclicality, Belhadia Abdellah, The long history of economic and financial crises shows that pro-cyclicality is an inherent feature of the real and financial sectors of an economy. The main feature of pro-cyclicality is an… Категория: Финансы Подробнее Купить за 7289 руб
- Irreducible Cyclic Codes and Polyadic Codes, Anuradha Sharma, In this book, explicit expressions of all thegenerating idempotents of irreducible cyclic codes oflength p^n and 2p^n over GF(q) are obtained, where pis an oddprime, p does not divide… Категория: Алгебра Издатель: LAP Lambert Academic Publishing, Подробнее Купить за 6002 руб