您要查找的是不是：
- 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次匹配的解。
- 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)題提供了新的求解途徑。
- 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í)間算法。
- 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í)間。
- 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í)間算法。
- The mistake in the proving process of the problem of deciding BCNF in reference[1] is pointed out,and a polynomial time algorithm to decide whether a relation schema is in BCNF is given. 摘要文中指出了文獻[1]中對BCNF判定問(wèn)題證明過(guò)程的錯誤之處，通過(guò)分析屬于BCNF的關(guān)系模式的結構特點(diǎn)，給出了一個(gè)判定關(guān)系模式是否屬于BCNF的多項式時(shí)間算法.
- Somehow I'm sensing that this time problem is a major issue with you. 你讓我感覺(jué)時(shí)間是你的主要事情。
- The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 給出了弦環(huán)的實(shí)用全終端可靠度的一種計算方法;此方法是多項式時(shí)間的.
- Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最后給出了一個(gè)求FD集最優(yōu)覆蓋的多項式時(shí)間算法。
- 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)題。
- 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)題（只要變量不是很多）。
- Well, I do not know if any of you is able and willing to resolve this time problem. 我不知道你們當中是否有人能夠并且愿意下決心解決這個(gè)時(shí)間的問(wèn)題。
- 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)的遺傳算法。
- Good morning! Due to the time problem we could not get visas to your country before leaving China. 早晨好！由于時(shí)間關(guān)系，我們在離開(kāi)中國之前未能取得貴國簽證。
- 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í)間算法。
