polynomial complexity 中文意思是什麼
polynomial complexity
解釋
多項式復雜性- polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
- complexity : n. 1. 復雜性，復合狀態。2. 復合物；復雜的事物[情況]。
-
An infeasible path - following algorithm is constructed, and its polynomial complexity is analyzed. numerical tests show the self - adjusting effect of the parameters
基於這組方程，文中建立了一個求解線性互補的不可行內點演算法，並分析了它的多項式復雜度。 -
The experimental results show that these two algorithms are efficient and computational complexity is low. ( 2 ) we prove that necessary and sufficient conditions for bounded and closed ip curves are that second - degree polynomial factor curves in the leading binomial product v abstract decomposed from the leading form of [ p are ellipses
（ 2 ）證明了隱含多項式曲線封閉有界的條件是隱含多項式分解的首二次因子積中的二次因子曲線是橢圓曲線，並給出了避免隱含多項式曲線自相交的條件。 -
Without the strict feasibility of the initial points and iteration points, the algorithm is shown to possess both polynomial - time complexity and q - linear convergence
該演算法不要求初始點及迭代點的可行性且具有q -線性收斂速度和多項式時間復雜性。 -
By making algebraically equivalent transformation for the standard centering equation xs = e, we obtain a new system of perturbed k - k - t equations and, for specific power transformation, recover the newton equations that are recently used by j. m. peng et al to show a lower polynomial complexity bound for large - update algorithm
前述的兩種方法是針對擾動k一k一t系統進行的，而本文的另一種方法是採用ncp函數，直接將標準線性規劃k一k一t條件化為一個不含內點約束的等價方程組，以此改造標準攝動方程組。 -
For the total tardiness scheduling with precedence constraints, an approximation algorithm with polynomial complexity was presented by transplanting the backward - shift algorithm of the case without precedence constraints
摘要把工件之間不帶前後約束的延誤排序的后移演算法移植到帶有前後約束的情況，提出一個多項式時間的近似演算法。 -
It is shown that randomized algorithms can decrease the computational complexity dramatically instead of seeking worst case guarantees. in addition, examples in this paper show that employing randomized algorithms is very efficient and has obvious advantages especially when uncertain interval parameters appear multilinearly or nonlinearly in the characteristic polynomial coefficients
研究表明，在不考慮最壞情況的意義下，隨機化演算法可以顯著降低計算復雜性，另外，當不確定區間參數以多線性或非線性的方式出現在特徵多項式系數中時，採用隨機化演算法具有明顯的優點並且是非常有效的，文中給出了計算實例。 -
Because the most scheduling problem is np hard, it is impossible to find out common algorithm with polynomial complexity
由於調度問題大多數都是具有np難度的組合優化問題，尋找具有多項式復雜性的優化方法幾乎是不可能的。 -
This algorithm improves confidence in se by estimating parameters and states at the same time. simulation results on test power systems which range in size from 4 to 118 buses, have shown the virtues as follows : getting unbiased estimation without detecting and identifying bad data in measurements ; solving state and parameter estimation for power system with good convergence and excellent robust property ; increasing the numbers of iterations a little bit with the test systems expanded ; estimating many transformer taps simultaneously and remaining the main state estimation ; keeping the estimated relative error within + 0. 1 % and processing efficiently equality constraints and ill condition with polynomial complexity
對ieee ? 4 118節點系統和廣西主網進行的模擬結果表明： l1范數估計具有不良數據拒絕特性，當量測量中存在不良數據時，該演算法在不經檢測和辨識不良數據情況下仍是無偏估計，具有良好收斂性，所需迭代次數隨著問題規模擴大而增長極小；能夠同時估計多個變壓器抽頭，並保持狀態估計主體；在滿足可觀測性條件下，估計的相對誤差保證在0 . 1以內；能夠有效處理等式約束和病態條件，並具有多項式時間性。 -
4. a fast algorithm for computing the linear complexity and the minimal polynomial of a binary sequence with period t ? m is proposed, and generalized one for determining the linear complexity of a sequence with period pmqfl over gf ( q )
提出確定周期為2 ~ np ~ m的二元序列的線性復雜度和極小多項式的一個快速演算法，並推廣為計算gf （ q ）上周期為p ~ mq ~ n序列的線性復雜度和極小多項式的快速演算法。 -
Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial
文摘:本文為框式約束的一類凸規劃提出了一個新的內點演算法，原始-對偶路徑跟蹤法，並證明了演算法的迭代復雜性為多項式時間性 -
After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial
再次，對有序決策表進行了研究，提出了一種基於優勢矩陣的啟發式屬性約簡演算法。 -
The complexity of kf - diff is o ( nlogn ), while n is the number of the nodes in the tree, vs. polynomial time for previous algorithms
在演算法復雜度上從先前的多項式時間提高到o （ nlogn ） ，其中n為文檔結點數。 -
We prove that the worst - case ratio of algorithm d is 15 / 13, which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity
我們證明了對三臺機情形，演算法d的最壞情況界為15 13 ，該演算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似演算法。 -
Numerical experiments with four test functions are performed, and some valuable conclusions are reached. first, the efficacy of full dominance - recessive diploid genetic algorithm outperforms the standard genetic algorithm ( sga ) in high - dimensional functions. the time complexity of the proposed ga approximates a polynomial multiple of that of sga
通過對四個常用測試函數用完全顯隱性二倍體遺傳演算法和標準遺傳演算法進行初始解相同的對比試驗，表明完全顯隱性二倍體遺傳演算法在十維以上的高維函數優化問題中解的效果明顯優于標準遺傳演算法，對低維函數優化問題也不劣於標準遺傳演算法。 -
5. a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2pfl over gf ( q ) is proposed, and a new algorithm for determining the linear complexity of a sequence with period pfl over gf ( p ? ) is introduced
提出一個計算gf （ q ）上周期為2p ~ n序列的線性復雜度和極小多項式的快速演算法；提出一個計算gf （ p ~ m ）上周期為p ~ n的序列的線性復雜度的新演算法。 -
The bit - operation complexity of the fast exponential algorithm is polynomial
快速指數演算法的比特運算復雜度是多項式的。 -
( 3 ) compare the complexity and precision of the polynomial method and orthogonal polynomials method used in geometrical adjustment, an experiment is made ; some surface fitting method used in spatial co - registration of multiresolution image are studied and experiments are made to show their different in effects ; in order to increase the spectral inherit, we make a histogram match in images to be fused
比較了圖像幾何校正的多項式方法和正交多項式方法在復雜度與精度上的差異，進行了模擬實驗；研究了不同插值技術在圖像配準中的應用，對不同插值方法的效果進行了比較，給出了示意圖；為消除圖像灰度級不匹配對融合結果的影響，對待融合圖像的灰度直方圖進行了匹配處理。
分享友人