| 单词 | computational complexity |
| 释义 | > as lemmascomputational complexity c. Mathematics. More fully computational complexity. A measure of the difficulty of solving a class of problem, as measured by the expected number of computational steps required to do so using an algorithm; the branch of computational theory concerned with this property. ΘΚΠ the world > relative properties > number > mathematics > [noun] > theories or branches of menadry1570 pure mathematics1605 mechanics1612 residuation1846 chaos theory1880 number theory1901 formalism1913 intuitionism1913 replacement theory1914 biomathematics1923 proof theory1929 finitism1935 mereology1938 combinatorics1941 cryptarithmetic1943 game theory1945 numerical analysis1946 queueing theory1951 constructivism1959 complexity1963 catastrophe theory1971 chaology1985 the world > relative properties > number > mathematics > [noun] > mathematical enquiry > process of calculating > difficulty of complexity1963 1963 Israel Jrnl. Math. 1 211 Hartmanis, J. and Stearns, R. E., On the computational complexity of algorithms, Trans. Amer. Math. Soc. to appear. 1965 Hartmanis & Stearns in Trans. Amer. Math. Soc. 117 285 The computational complexity of a sequence is to be measured by how fast a multitape Turing machine can print out the terms of the sequence. 1967 Jrnl. Assoc. Computing Machinery 14 322 The complexity theory offered here is machine-independent. 1970 Jrnl. Symbolic Logic 35 559 After one other expository chapter and a chapter on homomorphisms and semilocal theory of finite semigroups, these results are applied to gain deeper insight into the complexity theory. 1979 E. S. Page & L. B. Wilson Introd. Computational Combinatorics vi. 155 The problems which have so far attracted most study by theorists working in complexity fall into two classes. 1982 J. Campbell Grammatical Man ii. ix. 105 The power of a small number of fixed rules to produce an unpredictable amount of complexity. 1989 Encycl. Brit. XVI. 632/2 The prominent research in this field concerns the theory of computational complexity. 1989 Encycl. Brit. XVI. 633/1 The complexity of the best available algorithm for the solution of a problem is compared with the complexity of the problem to decide whether a better algorithm can be devised. 1989 R. Penrose Emperor's New Mind (1991) iv. 141 Complexity theory is concerned not so much with the difficulty of solving single problems algorithmically, but with infinite families of problems where there would be a general algorithm for finding answers to all the problems of one single family. 1989 R. Penrose Emperor's New Mind iv. 141 Even among mathematical problems that are algorithmic in nature, there are some classes of problem that are intrinsically vastly more difficult to solve algorithmically than others...The theory which is concerned with questions of this kind is called complexity theory. < as lemmas |
| 随便看 |
英语词典包含1132095条英英释义在线翻译词条，基本涵盖了全部常用单词的英英翻译及用法，是英语学习的有利工具。