The phrase "a time efficient algorithm" is correct and usable in written English.
It can be used when discussing algorithms that perform tasks quickly and effectively, particularly in computer science or mathematics.
Example: "The researchers developed a time efficient algorithm that significantly reduced the processing time for large datasets."
Alternatives: "a time-saving algorithm" or "an efficient algorithm in terms of time".
Polynomial time algorithms to find good approximate solutions to either problem most likely do not exist (under certain complexity assumptions), but a time efficient approximation algorithm is shown that solves a special case of these problems.
Here we present version 2.0 of the khmer software package, a high-performance library implementing memory- and time-efficient algorithms for the manipulation and analysis of short-read data sets.
The development of time-efficient algorithms for this problem is, therefore, crucial for successful real-world applications.
Historically, suffix trees received much attention because time-efficient algorithms for their construction and use were developed early [ 1].
Therefore, to harvest the benefits of utilizing NGS technology, the development of space- and time-efficient algorithms to complete the assembly process has become inevitable.
Furthermore, we show that the string graph can be constructed directly using the FM-index without the need for explicitly finding all overlaps and a subsequent transitive removal step, yielding a space and time efficient construction algorithm.
The amount of input image data calls for a time-efficient and at least semiautomatic algorithm in order to reduce man-hours spent on segmentation.
It is investigated when the limits for t-ratio are computable in polynomial time and a new efficient algorithm is designed for this case.
This paper presents a memory and time efficient string matching algorithm specifically designed for NIMS on commodity processors.
They presented a new and efficient algorithm for solving a time fractional subdiffusion equation on a semiinfinite domain.
