computational complexity

基本解釋

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們?nèi)蘸?要講的計算復(fù)雜度的,一個前言。
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：計算復(fù)雜性理論使用大 0 符號描述輸入數(shù)據(jù)大小如何影響計算資源對算法的使用。
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.
對于學(xué)生來說，計算“計算復(fù)雜度”似乎是較難的課題之一；但是當(dāng)這些方法產(chǎn)生這樣的加速時，它們的價值無庸置疑。

And that is a preface to an idea of computational complexity we're going to come back to.
這是我們?nèi)蘸?要講的計算復(fù)雜度的,一個前言。
麻省理工公開課 - 計算機(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í)了這門課程的一部分了，我們要開始認(rèn)識到,計算的復(fù)雜度這個概念，你會學(xué)習(xí)到我們在乎的并不是,算法在簡單問題上的工作效率,而是解決復(fù)雜問題的效率。
麻省理工公開課 - 計算機(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