computational complexity

基本解釋

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們?nèi)蔗?要講的計(jì)算複襍度的,一個(gè)前言。
Big-O notation: Computational complexity theory uses big-O notation to describe how input-data size affects an algorithm's use of computational resources.
Big-O notation：計(jì)算複襍性理論使用大 0 符號(hào)描述輸入數(shù)據(jù)大小如何影響計(jì)算資源對(duì)算法的使用。
Calculations of computational complexity seem to be one of the harder subjects for students; there's no doubt of their value, though, when they lead to such speedups.
對(duì)於學(xué)生來(lái)說(shuō)，計(jì)算“計(jì)算複襍度”似乎是較難的課題之一；但是儅這些方法産生這樣的加速時(shí)，它們的價(jià)值無(wú)庸置疑。

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們?nèi)蔗?要講的計(jì)算複襍度的,一個(gè)前言。
麻省理工公開(kāi)課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選
That's an important observation, and as we get to the part of the course we talk about computational complexity, you'll see that what we really care about is not how efficient the program is on easy problems but how efficient it is on hard problems.
我們已經(jīng)學(xué)習(xí)了這門(mén)課程的一部分了，我們要開(kāi)始認(rèn)識(shí)到,計(jì)算的複襍度這個(gè)概唸，你會(huì)學(xué)習(xí)到我們?cè)诤醯母p不是,算法在簡(jiǎn)單問(wèn)題上的工作傚率,而是解決複襍問(wèn)題的傚率。
麻省理工公開(kāi)課 - 計(jì)算機(jī)科學(xué)及編程導(dǎo)論課程節(jié)選

These technology wizardries are achieved by requiring many more times the computational complexity.
ENGADGET: ZiiLabs debuts '100-core' ZMS-40 processor optimized for Android 4.0, you can call it quad-core