必应词典为您提供polynomial-time-algorithm的释义,un. 多项式时间算法; 网络释义: 素数判定;
As a first ingredient, we need apolynomial timealgorithm for the following problem: Given ann-element setY, a system ℛ of subsets ofY, and a parameterr, we want to compute a (1/r)-approximation of sizes=O(r2logr). This is much weaker thanTheorem 4.2, since we only want time poly...
Algorithmgenome rearrangementtranslocationTranslocation is a prevalent rearrangement event in the evolution of multi-chromosomal species which exchanges ends between two chromosomes. A translocation is reciprocal if none of the exchanged ends is empty; otherwise, non-reciprocal. Given two signed multi-...
An entire space polynomial-time algorithm for linear programming We propose an entire space polynomial-time algorithm for linear programming. First, we give a class of penalty functions on entire space for linear program... GT Da - 《Journal of Global Optimization》 被引量: 63发表: 2014年 A ...
We introduce a new polynomial-time algorithm for learning optimal DBNs consistent with a breadth-first search (BFS) order, named bcDBN. The proposed algorithm considers the set of networks such that each transition network has a bounded in-degree, allowing for p edges from past time slices (...
New-polynomial-time-algorithm-for-linear-programming网页 图片 视频 学术 词典 航班 New-polynomial-time-algorithm-for-linear-programming 例句 释义: 全部 更多例句筛选 1. New polynomial-time algorithm for linear programming 线性规划的新多项式时间算法 encyclopedia.figureout.info...
Thepolynomial-timealgorithmcaneffectivelyproducetheoptimaltransportscheme. 该算法能够较快地找到最优运输方案。 www.ceps.com.tw 6. ThevehicleschedulingproblemisaNP-hardproblemwithoutpolynomialtimealgorithm. 车辆调度问题是一个NP-难问题,不存在多项式时间算法。
A POLYNOMIAL-TIME ALGORITHM FOR NEAR-PERFECT PHYLOGENY ∗ DAVID FERN ´ ANDEZ-BACA † AND JENS LAGERGREN ‡ SIAM J. COMPUT. c 2003 Society for Industrial and Applied Mathematics Vol. 32, No. 5, pp. 1115–1127 Abstract. A parameterized version of the Steiner tree problem in phylogeny...
The authors give an algorithm to solve by O((logp) 3 ) operations in p the discrete logarithm problem for p -rational points of an anomalous elliptic curve E over p . The methods are different from that of I. A. Semaev [Math. Comput. ... T Satoh,K Araki - 《Sūrikaisekikenkyūsho...
We then provide polynomial-time algorithms to calculate the behavioural distances, in both the non-discounted and the discounted setting. The algorithm is strongly polynomial in the former case. 展开 关键词: Fuzzy transition systems Fuzzy automata Pseudo-ultrametric Algorithm ...