Examples of using Efficient algorithm in English and their translations into Hungarian
{-}
-
Colloquial
-
Official
-
Medicine
-
Ecclesiastic
-
Financial
-
Programming
-
Official/political
-
Computer
Fast and efficient algorithms.
That problem is NP-Complete,what means that there is not know an efficient algorithm to solve it.
An Efficient Algorithm for….
Better and more efficient algorithms.
No efficient algorithm to solve this problem is known.
A fast and memory efficient algorithm.
The efficient algorithm of\(O(N\log N)\) steps runs on each of the following inputs in a few seconds.
There is a MUCH more efficient algorithm.
This does not come for free though- the complexity of LTL model checking is in the PSPACE class,thus it is vital to use efficient algorithms.
High speed search provides an efficient algorithm for indexing.
The number of channel parameters that need to be analysed by handsets to deliver optimum data rateshave outpaced the ability of engineers to develop efficient algorithms.
Let's try to achieve the efficient algorithm of\(O(N\log N)\) steps.
The independent set decision problem is NP-complete,and hence it is not believed that there is an efficient algorithm for solving it.
There is no known efficient algorithm for solving that problem.
Although the Hamiltonian PathProblem has been studied extensively, an efficient algorithm to solve it is yet to emerge.
The two key requirements are(a) efficient algorithms and data-structures, and(b) current-generation high performance computers.
This can be done with a few, efficient algorithms.
Since the proving of the theorem, efficient algorithms have been found for 4-coloring maps requiring only O(n2) time, where n is the number of vertices.
The second problem was recently shown to be NP-Complete,hence it is highly unlikely that an efficient algorithm exists.
Again there are no known efficient algorithms to solve this problem.
The purpose of the scientific query to bedone with the help of Momentum Funds is to work out a mathematical model or theory that provides efficient algorithms for the assessment and attenuation of risks.
It was shown during the early 1970's that no efficient algorithm for the problem is at all possible(proving it is still an open problem!).
For example, the results related to the clique problem have the following corollaries: The independent set decision problem is NP-complete,and hence it is not believed that there is an efficient algorithm for solving it.
As such, it is unlikely that there exists an efficient algorithm for finding a maximum independent set of a graph.
In my thesis I examine the JPEG 2000 standard based on the discrete wavelet transformation, then I review the mathematical basics of wavelettransformation in order to get a deeper understanding of it and search for an efficient algorithm as well.
At this point you have failed to obtain an efficient algorithm and you have failed to prove that such an algorithm is not possible.
When a new version of a library is published it often contains some new functions,uses more efficient algorithms for already implemented functions, and so on.
In my thesis I examine and implement some efficient algorithms for handling the size of the state space, furthermore I recommend some changes in order to make the analyses even more efficient. .
If you can show that the problem is NP-complete,you can instead spend your time developing an efficient algorithm that gives a good, but not the best possible.
There are no known efficient solution to any NP-complete problem butnobody has ever proven that an efficient algorithm for an NP-complete problem cannot exist.