Примеры использования Linear time на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
Linear time.
It can be solved in linear time.
And linear time.
Then, for you, there is no linear time.
Linear time exists only on Earth;
A predictive parser runs in linear time.
Linear time was correlated with an increase in pH and ANC, and a decrease in LAl.
It is easy to see that this algorithm runs in linear time.
Both of these numbers may be computed in linear time as part of the depth-first search.
It turns out that step 4 may be accomplished in linear time.
An additional later improvement to linear time by Kawarabayashi& Reed(2007) follows the same approach.
This kernelization may be implemented in linear time.
However, it relies on the linear time polygon triangulation algorithm by Chazelle, which is extremely complex.
For undirected trees, tree-depth can be computed in linear time.
Peripheral cycles in 3-connected graphs can be computed in linear time and have been used for designing planarity tests.
Initializing the variables I, dv, D, andk can easily be done in linear time.
Chu(2008) describes a simple linear time algorithm for recognizing trivially perfect graphs, based on lexicographic breadth-first search.
Suffix tree Figuratively structured like a tree,supports linear time lookup.
Rejoice with us about a recent development in your linear time regarding the greater numbers of souls who may physically accompany Earth into that Age!
A transitive orientation of a graph, if it exists,can be found in linear time.
Based on this test, there also exists a linear time algorithm for finding a widest s-t path in an undirected graph, that does not use the maximum spanning tree.
If these lists are stored in a sorted form, their merging is executed in linear time.
However, the cycles are long by your measure using linear time, and if you but knew you would be more inclined to put the effort in to ascend this time round.
Based on the characterization by oriented trees,Ptolemaic graphs can be recognized in linear time.
Kooshesh& Moret(1992) gave a linear time algorithm by using Fisk's short proof and Bernard Chazelle's linear time plane triangulation algorithm.
However, in the special case of outer-1-planar graphs,a RAC drawing can be constructed in linear time.
The stunning difference this time was, all participants knew that they would be helping to create in linear time a world that already exists in the continuum by virtue of Gaia's manifestation.
Once the minimum spanning tree edges have been sorted,this Cartesian tree can be constructed in linear time.
Given a simple polygon P{\displaystyle{\mathcal{P}}} and a point p{\displaystyle p}, a linear time algorithm is optimal for computing the region in P{\displaystyle{\mathcal{P}}} that is visible from p{\displaystyle p.
In the continuum, this wondrous world that you have been co-creating already exists, and in linear time, you are almost there!