<span class="searchmatch">time</span> <span class="searchmatch">algorithms</span> plural of <span class="searchmatch">time</span> <span class="searchmatch">algorithm</span>...
<span class="searchmatch">time</span> <span class="searchmatch">algorithm</span> (plural <span class="searchmatch">time</span> <span class="searchmatch">algorithms</span>) (computer science) An <span class="searchmatch">algorithm</span> which specifies the amount of <span class="searchmatch">time</span> required to solve a problem as a function of...
Kosaraju's <span class="searchmatch">algorithm</span> (plural Kosaraju's <span class="searchmatch">algorithms</span>) A linear <span class="searchmatch">time</span> <span class="searchmatch">algorithm</span> to find the strongly connected components of a directed graph....
26, Leo Hickman, “How <span class="searchmatch">algorithms</span> rule the world”, in The Guardian Weekly[1], volume 189, number 7, page 26: The use of <span class="searchmatch">algorithms</span> in policing is one example...
subquadratic <span class="searchmatch">time</span> (plural subquadratic times) (computer science) A <span class="searchmatch">time</span> <span class="searchmatch">algorithm</span> that runs in greater than linear, but less than quadratic <span class="searchmatch">time</span>....
Wikipedia has an article on: approximation <span class="searchmatch">algorithm</span> Wikipedia approximation <span class="searchmatch">algorithm</span> (plural approximation <span class="searchmatch">algorithms</span>) (computing) A method of finding a nearly...
<span class="searchmatch">time</span> complexity (usually uncountable, plural <span class="searchmatch">time</span> complexities) (computer science) The amount of <span class="searchmatch">time</span> an <span class="searchmatch">algorithm</span> requires to run, as a function of the...
quadratic <span class="searchmatch">time</span> (countable and uncountable, plural quadratic times) (computer science) A <span class="searchmatch">time</span> <span class="searchmatch">algorithm</span> in which given an input of size n, the number of...
cosmic <span class="searchmatch">time</span> coyote <span class="searchmatch">time</span> CPU <span class="searchmatch">time</span> crossing <span class="searchmatch">time</span> crunch <span class="searchmatch">time</span> cubic <span class="searchmatch">time</span> cucumber <span class="searchmatch">time</span> cure <span class="searchmatch">time</span> curing <span class="searchmatch">time</span> curtain <span class="searchmatch">time</span> cut-off <span class="searchmatch">time</span> cut <span class="searchmatch">time</span> cycle <span class="searchmatch">time</span> damage...
pseudo-polynomial <span class="searchmatch">time</span> (countable and uncountable, plural pseudo-polynomial times) (computer science, computational complexity theory) A <span class="searchmatch">time</span> <span class="searchmatch">algorithm</span> whose running...