您要查找的是不是：
- polynomial time reduction 多项式时间归约
- Throughput time / Cycle time reduction. 制造周期和产品周期的缩减。
- The paper offers polynomial time algorithm of the functional all-terminal reliability of cordal ring. 给出了弦环的实用全终端可靠度的一种计算方法;此方法是多项式时间的.
- Theorem 4.1 Algorithm 4 can solve the problem (P) by using at most 2k-1 matchings in polynomial time. 定理4.;1 算法4能够在多项式时间内给出问题（P）的一个用2k-1次匹配的解。
- Finally, a polynomial time algorithm for solving an optimal cover of FD set is given. 最后给出了一个求FD集最优覆盖的多项式时间算法。
- Lead time reduction has been one of the major factors in the successful implementation of the popular just-in-time (JIT) inventory system. 中文摘要在现今竞争激烈的市场环境当中，由于资讯科技的进步，企业运用电子化相关技术来达成及时化生产的方法以维持本身的竞争优势。
- But the language constructed there is indeed an unnatural one because the construction needs to run all polynomial time Turing machines. 但 Lander给出语言并不是一个自然的语言因在该语言的构造中需运行所有多项式时间的图灵机 .
- It is impossible to tackle all combinatorial optimization problems (COP) in deterministic polynomial time with accurate solution. 由于组合优化问题的解空间十分庞大，使用精确求解方法无法在确定多项式时间内求得它的最优解。
- 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. 由于对于任意一个图着色例子而言，没有一种算法可以在多项式的时间内找到它的解，因此图的着色问题是一个NP难的问题。
- Maelstrom Weapon: Cast time reduction now applies to any spell with a cast time. 漩涡武器：触发机制改为每一下施法（攻击）都会触发。（不知道对不对）
- Meantime,the polynomial time algorithm is suggested.The method provides a new way for the bilevel decision problem and multi-level decision making. 同时，在上下层问题独立求解时，引入了一种多项式的时间算法，为两层以及多层决策问题提供了新的求解途径。
- The second algorithm takes polynomial time in the size of input.This algorithm effectively finds a minimum cover for FDs propagated from XML keys. 第二个算法需要花费输入集合的多项式时间倍,此算法有效地计算来自XML关键字的函数依赖最小覆盖的算法。
- It's commonly believed that no polynomial time algorithms exist for such formula satisfiability problems,since they belong to the NPC class. 布尔表达式的判定是NPC问题，用回溯法就能解决这一问题（只要变量不是很多）。
- The different cutting-out methods of explants affected the initial h ealing time of callus inductions, and could lead to time reduction. 外植体的不同切取方式对愈伤组织诱导的始愈时间有影响 ,经切取后可缩短始愈时间 ;
- The simulation results show that with this algorithm we can achieve significant time reduction while maintaining the PSNR and bit rate. 实验表明，本算法在编码性能下降可忽略的情况下，使编码时间有显著减少。
- 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. 本文讨论外平面图的反馈点集并给出了一个求外平面图最小反馈点集的多项式时间算法。
- Devise a genetic algorithm to solve the Economic Lot and Delivery Scheduling Problem-ELDSP, and compared with heuristic algorithm and polynomial time algorithm. 设计了基于经济批量与交货期问题(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. 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。
- D.Yao and B.Kim, ”Rapid Thermal Response Molding for Cycle Time Reduction”, SPE ANTEC Tech.Paper, pp.607-611. (2003). 3.D.H.Kim, M.H. 彭信舒，”射出成型模具表面瞬间加热建置与分析之研究”，私立中原大学机械工程学研究所博士论文(2003)。
- 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. 到目前为止，研究人员只找到少数的量子演算法，可以将一个问题的计算所需时间，由指数时间降到多项式时间。
