您要查找的是不是：
- The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 給出了弦環(huán)的實(shí)用全終端可靠度的一種計算方法;此方法是多項式時(shí)間的.
- Theorem 4.1 Algorithm 4 can solve the problem (P) by using at most 2k-1 matchings in polynomial time. 定理4.;1 算法4能夠在多項式時(shí)間內給出問(wèn)題（P）的一個(gè)用2k-1次匹配的解。
- Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最后給出了一個(gè)求FD集最優(yōu)覆蓋的多項式時(shí)間算法。
- The Kremlin said Wednesday the Time recognition was seen there as an acknowledgment of Putin's role in helping Russia pull out of its social and economic troubles in the 1990s. 克里姆林宮于本周三表示，普京當選《時(shí)代》年度人物是《時(shí)代》雜志對其政績(jì)的承認，普京總統帶領(lǐng)俄羅斯走出了上世紀90年代的社會(huì )和經(jīng)濟困境。
- But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines. 但 Lander給出語(yǔ)言并不是一個(gè)自然的語(yǔ)言因在該語(yǔ)言的構造中需運行所有多項式時(shí)間的圖靈機 .
- It is impossible to tackle all combinatorial optimization problems (COP) in deterministic polynomial time with accurate solution. 由于組合優(yōu)化問(wèn)題的解空間十分龐大，使用精確求解方法無(wú)法在確定多項式時(shí)間內求得它的最優(yōu)解。
- Yet, it cannot be expected that an algorithm can find, in polynomial time, a solution to an arbitrary GCP instance, because the GCP is NP-hard. 由于對于任意一個(gè)圖著(zhù)色例子而言，沒(méi)有一種算法可以在多項式的時(shí)間內找到它的解，因此圖的著(zhù)色問(wèn)題是一個(gè)NP難的問(wèn)題。
- Meantime,the polynomial time algorithm is suggested.The method provides a new way for the bilevel decision problem and multi-level decision making. 同時(shí)，在上下層問(wèn)題獨立求解時(shí)，引入了一種多項式的時(shí)間算法，為兩層以及多層決策問(wèn)題提供了新的求解途徑。
- The second algorithm takes polynomial time in the size of input.This algorithm effectively finds a minimum cover for FDs propagated from XML keys. 第二個(gè)算法需要花費輸入集合的多項式時(shí)間倍,此算法有效地計算來(lái)自XML關(guān)鍵字的函數依賴(lài)最小覆蓋的算法。
- It's commonly believed that no polynomial time algorithms exist for such formula satisfiability problems,since they belong to the NPC class. 布爾表達式的判定是NPC問(wèn)題，用回溯法就能解決這一問(wèn)題（只要變量不是很多）。
- In this paper, we study the undirected minimum-cardinality feedback vertex set problem in outer-planar graphs and present a polynomial time algorithm to solve it. 本文討論外平面圖的反饋點(diǎn)集并給出了一個(gè)求外平面圖最小反饋點(diǎn)集的多項式時(shí)間算法。
- Devise a genetic algorithm to solve the Economic Lot and Delivery Scheduling Problem-ELDSP, and compared with heuristic algorithm and polynomial time algorithm. 設計了基于經(jīng)濟批量與交貨期問(wèn)題(ELDSP)的遺傳算法。
- The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system. 內點(diǎn)法是一種求解線(xiàn)性規劃問(wèn)題的多項式時(shí)間算法,其顯著(zhù)特征是其迭代次數與系統規模關(guān)系不大。
- To this day, researchers have found only a few other quantum algorithms that appear to provide a speedup from exponential to polynomial time for a problem. 到目前為止，研究人員只找到少數的量子演算法，可以將一個(gè)問(wèn)題的計算所需時(shí)間，由指數時(shí)間降到多項式時(shí)間。
- The good performance players can get timely recognition and promotion in big Cummins family organization. 對業(yè)績(jì)良好的員工及時(shí)認可并在康明斯大家族的范圍內為他/她們提供職業(yè)升遷的機會(huì )。
- AKS algorithm was proposed by three computer scientists in India in Aug 2002.This algorithm can unconditionally determine whether an input number is a prime in polynomial time. AKS算法是3位印度的計算機科學(xué)家于2002年8月提出的;它是一個(gè)能在輸入規模的多項式時(shí)間內確定的對一個(gè)數進(jìn)行素性測試的方法.
- Taking the maximum lateness as objective function, this paper develops a polynomial time algorithms for the processing sequence of the n jobs given or not given. 文中以工件的最大遲后為目標函數，對工件加工順序預先給定和可任意時(shí)的最優(yōu)分批分別給出了多項式時(shí)間算法。
- Further Neurophone advances include the development of the time recognition processor, improved memory applications and the advances in satellites incorporating neurophone technologies. 更進(jìn)一步腦聽(tīng)器的進(jìn)展包括發(fā)展時(shí)間識別處理機，提高記憶應用和在混合衛星技術(shù)方面的發(fā)展。
- Luebke and Provan proved that the Euclidean 2-connected Steiner network problem is NP-hard, which means that there are few possibilities of existing a polynomial time algorithm for a general finite set P of points in the Euclidean plane. Luebke和Provan證明了歐幾里德2-連通Steiner網(wǎng)絡(luò )問(wèn)題是NP-困難的。 這意味著(zhù)對一般的平面有限點(diǎn)集而言,不大可能存在求解這個(gè)問(wèn)題的多項式時(shí)間算法。
- Based on the above results, an approximate fast algorithm is obtained for the decision problem of DNF validity. Using this algorithm, most DNF validity problems can be solved in polynomial time. 基于所得結果,對于析取范式永真性判定問(wèn)題得出了一個(gè)近似快速的求解算法,按此算法,對絕大多數的析取范式,其永真性問(wèn)題,在多項式時(shí)間內都可解決。
