- operation complexity
- сложность эксплуатации
Большой англо-русский и русско-английский словарь. 2001.
operation complexity
Смотреть что такое "operation complexity" в других словарях:
Operation Frequent Wind — Part of the Fall of Saigon, Vietnam War … Wikipedia
Operation APOLLO — (Op APOLLO ) was the codename for an operation conducted by Canadian Forces in support of the United States in its military operations in Afghanistan. The operation took place from October 2001 to October 2003. In addition, the sequence of events … Wikipedia
Operation Burnt Frost — Break up of USA 193 following interception Objective Destruction of non functioning satellite USA 193 Date 4 January – 20 February 20 … Wikipedia
Operation MB8 — was a British Royal Navy operation in the Mediterranean Sea during 4 11 November 1940. It was made up of six forces totalling two aircraft carriers, five battleships, 10 cruisers, and 30 destroyers, including much of Force H protecting four… … Wikipedia
Operation Fustian — Part of Allied invasion of Sicily … Wikipedia
Operation Apollo — v · … Wikipedia
Trust Operation — Operation Trust (операция Трест ) was a counterintelligence operation of the State Political Directorate (GPU) of the Soviet Union. The operation, which ran from 1921 1926, set up a fake anti Bolshevik underground organization, Monarchist Union… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Computational complexity of mathematical operations — The following tables list the running time of various algorithms for common mathematical operations. Here, complexity refers to the time complexity of performing computations on a multitape Turing machine.[1] See big O notation for an explanation … Wikipedia
Context of computational complexity — In computational complexity theory and analysis of algorithms, a number of metrics are defined describing the resources, such as time or space, that a machine needs to solve a particular problem. Interpreting these metrics meaningfully requires… … Wikipedia
IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists … Wikipedia
