Sentence examples for function in polynomial time from inspiring English sources

Since MCKP is NP-hard and it is hard to approximate by any linear function in polynomial time, we use the generate and verify method to explore the whole search space.

Our algorithms are based on submodular function and are implementable in polynomial time using efficient network flow based subroutines.

The minimum value of a submodular function can be found in polynomial time.

Distance-based reconstruction methods typically run in time polynomial in the number and size of genomes and fast and accurate heuristics exist for those where the scoring function cannot be computed in polynomial time, such as least-squares or minimum evolution methods.

Then a graph cuts algorithm can be adopted to minimize the objective function and get the source distribution in polynomial time.

Similarly, we define \ \Box^P_{n+1}\) to be the class of functions computable by a deterministic Turing machine in polynomial time with the use of an oracles for a set in level \(\Sigma^P_n\) of \ \textbf{PH}\).

In this article, we improve this understanding by developing an approach to characterizing clique tree growth as a function of parameters that can be computed in polynomial time from BNs, specifically: (i) the ratio of the number of a BN's non-root nodes to the number of root nodes, and (ii) the expected number of moral edges in their moral graphs.

For instance we may consider the class \ \textbf{FP} =_{\text{df}}\Box^P_1\) of functions computable by a deterministic Turing machine in polynomial time.

We will discuss the property of the objective function and show that its solution can be obtained in polynomial time.

In general, it seems that a factorization of partition functions is essential for solving DNA and RNA models in polynomial time.

We present an algorithm which in polynomial time constructs a k-maintainable control function, if one exists, or tells that no such control is possible.