<span class="searchmatch">time</span> <span class="searchmatch">complexity</span> (usually uncountable, plural <span class="searchmatch">time</span> <span class="searchmatch">complexities</span>) (computer science) The amount of <span class="searchmatch">time</span> an algorithm requires to run, as a function of the...
<span class="searchmatch">time</span> <span class="searchmatch">complexities</span> plural of <span class="searchmatch">time</span> <span class="searchmatch">complexity</span>...
<span class="searchmatch">time</span>-space <span class="searchmatch">complexity</span> (usually uncountable, plural <span class="searchmatch">time</span>-space <span class="searchmatch">complexities</span>) (computer science) The combination of the measure of the amount of <span class="searchmatch">time</span> and...
<span class="searchmatch">time</span>-space <span class="searchmatch">complexities</span> plural of <span class="searchmatch">time</span>-space <span class="searchmatch">complexity</span>...
amount of scratch paper needed while working out a problem with pen and paper. Coordinate terms: <span class="searchmatch">time</span> <span class="searchmatch">complexity</span>, <span class="searchmatch">time</span>-space <span class="searchmatch">complexity</span> amount of space...
irreducible <span class="searchmatch">complexity</span> Kolmogorov <span class="searchmatch">complexity</span> McCabe's <span class="searchmatch">complexity</span> overcomplexity Rademacher <span class="searchmatch">complexity</span> space <span class="searchmatch">complexity</span> <span class="searchmatch">time</span> <span class="searchmatch">complexity</span> <span class="searchmatch">time</span>-space <span class="searchmatch">complexity</span> ultracomplexity...
on: linear <span class="searchmatch">time</span> Wikipedia linear <span class="searchmatch">time</span> (uncountable) (computing theory) The <span class="searchmatch">time</span> <span class="searchmatch">complexity</span>, denoted O(n), of an algorithm whose running <span class="searchmatch">time</span> increases...
English Wikipedia has an article on: <span class="searchmatch">complexity</span> function Wikipedia <span class="searchmatch">complexity</span> function (plural <span class="searchmatch">complexity</span> functions) (group theory, computing theory, of...
(jikan, “<span class="searchmatch">time</span>”) + 計算量 (keisanryō, “computational <span class="searchmatch">complexity</span>”) 時(じ)間(かん)計(けい)算(さん)量(りょう) • (jikankeisanryō) (computer science) <span class="searchmatch">time</span> <span class="searchmatch">complexity</span> 空間計算量(くうかんけいさんりょう)...
most superpolynomial) (computing, mathematics) Describing an algorithm whose execution <span class="searchmatch">time</span> is not limited by a polynomial <span class="searchmatch">Time</span> <span class="searchmatch">complexity</span> on Wikipedia...