special cycle

special cycle
мат. специальный цикл

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "special cycle" в других словарях:

  • Cycle De Fondation — Cet article fait partie de la série Science fiction La SF à l’écran autre A B C …   Wikipédia en Français

  • Cycle de fondation — Cet article fait partie de la série Science fiction La SF à l’écran autre A B C …   Wikipédia en Français

  • Special Warfare Combatant-craft Crewmen — Active 16 April 1987 Country United States Branch …   Wikipedia

  • Cycle Collstrop — Team information UCI code COS Based  Netherlands Disbanded 2008 …   Wikipedia

  • cycle path — cycle paths N COUNT A cycle path is a special path on which people can travel by bicycle separately from motor vehicles …   English dictionary

  • Special Air Service of New Zealand — Le Special Air Service de Nouvelle Zélande (NZ SAS) est une unité des Forces Spéciales de l Armée de Défense de la Nouvelle Zélande créé le 7 Juillet 1955 sur le modèle du Spécial Air Service britannique (SAS). Le gouvernement Néo Zélandais… …   Wikipédia en Français

  • Cycle rickshaw — Pedicab redirects here. For the the Philippines musical group, see Pedicab (band). Cycle rickshaw in Beijing …   Wikipedia

  • Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? …   Wikipedia

  • Cycle detection — This article is about iterated functions. For another use, see Cycle detection (graph theory). In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function ƒ that… …   Wikipedia

  • Special Projects Office-Program Executive Office Command Control Communications Tactical — PEO C3T Special Projects Office Active Country United States Branch Army Type Systems Integration Garrison/HQ Fort Mon …   Wikipedia

  • Cycle rank — In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this concept measures how close a digraph is to a directed acyclic graph (DAG), in the sense that a …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»