polynomial-time complexity

基本解釋

The method with computation complexity of polynomial order, has been successfully applied to the real-time analysis of signals in mobile ECG telemonitoring systems.
該算法具有多項(xiàng)式級(jí)的計(jì)算復(fù)雜度，已成功應(yīng)用于移動(dòng)式遠(yuǎn)程心電監(jiān)護(hù)系統(tǒng)ECG信號(hào)的實(shí)時(shí)分析。
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.
把工件之間不帶前后約束的延誤排序的后移算法移植到帶有前后約束的情況，提出一個(gè) 多項(xiàng)式時(shí)間的近似算法。
http://dj.iciba.com
This paper presents a new dependence difference inequality test algorithm for two-dimensional arrays, and proves that the time complexity of the algorithm is polynomial.
給出了二維數(shù)組的體差不等式測(cè)試算法，并證明二維數(shù)組的體差不等式測(cè)試算法具有多項(xiàng)式時(shí)間復(fù)雜度。