- degree of complexity
- мат. степень сложности
Большой англо-русский и русско-английский словарь. 2001.
degree of complexity
Смотреть что такое "degree of complexity" в других словарях:
complexity — /keuhm plek si tee/, n., pl. complexities for 2. 1. the state or quality of being complex; intricacy: the complexity of urban life. 2. something complex: the complexities of foreign policy. [1715 25; COMPLEX + ITY] * * * ▪ scientific theory… … Universalium
Complexity — For other uses, see Complexity (disambiguation). In general usage, complexity tends to be used to characterize something with many parts in intricate arrangement. The study of these complex linkages is the main goal of complex systems theory. In… … Wikipedia
complexity — noun ADJECTIVE ▪ considerable, enormous, extraordinary, extreme, great, immense ▪ full, sheer ▪ Only now did he unders … Collocations dictionary
Law of Complexity/Consciousness — The Law of Complexity/Consciousness is the tendency in matter to complexify upon itself and at the same time to increase in consciousness. The law was first formulated by Jesuit priest and paleontologist Pierre Teilhard de Chardin. Teilhard holds … Wikipedia
Strategic complexity — may refer to: * the degree of complexity of elements of a strategy * the number of elements of a strategic activity system (see Michael Porter s book Competitive Strategy for a discussion) * the emerging field of Complexity Theory and… … 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
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
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Circuit complexity — In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute them. A Boolean circuit with n input bits … 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
Cognitive complexity — Psychology Cognitive psychology Perception … Wikipedia
