Sentence examples for problem has been proved from inspiring English sources

As the RA-CARP problem has been proved to be solved in polynomial time, the problem CARP-D NP.

As the RA-CORP problem has been proved to be solved in polynomial time, CORP-D NP.

The use of Rao-Blackwellization to solve the smoothing problem has been proved to be more challenging and has received satisfactory solutions only recently.

Although the power domination problem has been proved to be NP-complete even when restricted to some special classes of graphs, Dorfling and Henning in [M. Dorfling, M.A. Henning, A note on power domination in grid graphs, Discrete Applied Mathematics 154 (2006) 1023 1027] showed that it is easy to determine the power domination number of an n×m grid.

LC, as a potential method for solving this problem, has been proved to have preventive effects on lymphatic metastases of gastroenteric cancers [ 3- 6].

This problem has been proven to be NP-hard.

This problem has been proven to be NP-complete [37].

The VN embedding problem has been proven to be NP-hard.

Since the p-median problem has been proven to be NP-hard, exact algorithms are not efficient in solving it in reasonable time.

The weighted set cover problem has been proven to be NP-hard so that a heuristic and iterative algorithm is generally used to solve it.

However, according to [16] we cannot expect to find an algorithm that can give the theoretical optimum solution and runs in polynomial time, as the abovementioned problem has been proven to be NP-hard.