That is to say , we can not use any polynomial algorithm to solve this kind of problems 也就是說,不能用任何已知的多項式算法求解這種問題。
Four special capacity expansion problem of undirected network were discussed and the responsible strongly polynomial algorithm was get 討論了無向網(wǎng)絡(luò)容量擴(kuò)充的4種特殊問題,給出了相應(yīng)的強(qiáng)多項式算法
The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete ) 裝箱問題是具有最高計算復(fù)雜性的一類問題: npc ( nondeterministicpolynomialcomplete非確定型多項式算法)類問題。
A new way to get the inflection point is brought forward . . it is to get the inflection point by using the least square imitate multinomial arithmetic . the result of experiment show that the method is right 采用了一種全新的計算拐點特征的方法,即:最小二乘擬合一次多項式算法計算手寫體數(shù)字的左右拐點。
Furthermore , the vertex - neighbor - scattering number of trees is discussed in details . the main contents of chapter 4 are the introduction of edge - neighbor - scattering number of graphs , the edge - neighbor - scattering number values of several simple graphs and a polynomial algorithm of the edge - neighbor - scattering number of trees 第四章主要定義圖的邊鄰域離散數(shù),給出一些基本圖的邊鄰域離散數(shù)值,圖的邊鄰域離散數(shù)的界,樹的邊鄰域離散數(shù)的一個多項式算法。