助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   np-完全 在 数学 分类中 的翻译结果: 查询用时:0.063秒
图标索引 在分类学科中查询
所有学科
数学
自动化技术
互联网技术
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

np-完全     
相关语句
  np-complete
    GRAPH SEPARATION IS NP-COMPLETE FOR 3-REGULAR GRAPHS
    3-正则图的分割问题是NP-完全问题
短句来源
    By [16, 36], the induced matching fc-partition problem is NP-complete, and also NP-complete for k = 2 and for 3-regular planar graphs, respectively.
    文[16,36]证明了图的导出匹配k-划分问题是NP-完全的,即使是对k=2和3-正则平面图这两种特殊情形也是NP-完全的。
短句来源
    Theorem 1. The induced matching 2-partition problem for graphs having diameter 6 is NP-complete.
    定理1.直径为6的图的导出匹配2-划分问题是NP-完全的。
短句来源
    Theorem 2. The induced matching 3-partition problem for graphs having diameter 2 is NP-complete.
    定理2.直径为2的图的导出匹配3-划分问题是NP-完全的。
短句来源
    The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
    最大团问题是组合优化中的一个经典的NP-完全问题。
短句来源
更多       
  np-completeness
    (3) the NP-completeness of the basic domination problem, its close and 'natural' relationships to other NP-complete problems, and the subsequent interest in finding polynomial time solutions to domination problems in special classes of graphs.
    (三) 图的控制参数确定问题的NP-完全性与其它组合优化中NP-完全问题紧密而自然的关系。 在特殊图(如弦图,圆弧图,区间图,AT-free图等)上,寻找各类控制参数的多项式时间算法已成为组合优化领域中一个引人入胜而富有挑战性的研究方向。
短句来源
    The NP-completeness of fill-in problem on general graph is proved by literature[12-14].
    一般图的填充问题被证明为NP-完全的。 因而对一般图的填充问题不可能有好算法。
短句来源
    Thus, the subset of satisfiability problem that originally belongs to the Class NP-Completeness is demonstrated to be belonging to the Class P.
    从而,把原来属于NP-完全类的SAT问题的一个子集,划入了P类。
短句来源
  np complete
    As this problem is NP complete, we develop a genetic algorithm approach to obtain the set of its non inferior solutions.
    由于该加工排序是一个 NP-完全问题 ,进而构造了一个新的遗传算法求解该问题的非劣解解集。
短句来源
  np-hard
    In theory, the packing problem of two-dimensional irregular shapes belongs to the NP-hard problems. It is very difficult to find the optimal solution for such a problem because of the high complexity of shapes and computation.
    二维不规则件的排样问题,在理论上属于NP-完全(困难)问题,因为存在实际形状的复杂性和计算上的复杂性,求解十分困难。
短句来源

 

查询“np-完全”译词为其他词的双语例句

 

查询“np-完全”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  np-complete
This paper proves that the (2,2) path chromatic number problem of graphs with maximum degree 4 is NP-complete.
      
In general, this problem is NP-complete and it is proved that forn=2 and 3 this problem is polynomial-time solvable.
      
MKP (B,S,m,n) is strongly NP-Complete and no polynomial-time approximation algorithm can have an approximation ratio better than 0.5.
      
Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.
      
In the authors' previous work, it has been proved that the problem is NP-complete and there does not exist any constant factor approximation algorithm for it unless P = NP.
      
更多          
  np-completeness
We prove the NP-completeness of the solvability problem in a free semigroup for equations of the formw(x1,...,xn)=g, wherew(x1,...,xn) is a semigroup word in the alphabet of unknowns andg is an element of a free semigroup.
      
A joint signature, entyption and error correction public-key cryptosystem is presented based on an NP-completeness problem-the decoding problem of general linear codes in algebraic coding theory.
      
The property of NP-completeness of topologic spatial reasoning problem has been proved.
      
The proof for the property of NP-completeness in directional spatial reasoning problem is based on two important transformations.
      
The NP-completeness of state safety (is there a sequence of state transitions leading to the empty state?) implies that a correct and scalable SCP will reject some safe states.
      
更多          
  np complete
Even if joint optimal path selection and rate allocation is in general an NP complete problem, an in-depth analysis of the media distortion evolution allows defining a low complexity optimal streaming strategy, under reasonable network assumptions.
      
Actually, since stacking sequences are usually NP complete, simulated annealing (SA) algorithms were borrowed to deal with the stacking sequence problems in this study.
      
It follows that the verification problem for sorting networks of depth 2D(n)+6?logn?+O(1) is Co-NP complete.
      
While all NP complete sets have these functions, Graph Isomorphism, which is probably not complete, is also shown to have both AND and OR functions.
      
Finally, most of the structural properties of the Boolean hierarchy and query hierarchies are shown to depend only on the existence of AND and OR functions for the NP complete sets.
      
更多          
  np-hard
It is known that the problem for general graphs is NP-hard while it is polynomially solvable for trees.
      
Some optimal conditions and algorithms are given and the fact that the problem of total weighted completion times is NP-hard is proved.
      
We also pseudopolynomially solve a class of QAP whose GLB is equal to the optimal objective function value, which was shown to remain NP-hard.
      
The problem of the minimum committee is known to be NP-hard.
      
Consideration was given to the p-median problem for minimum in the integer formulation which is known to be NP-hard.
      
更多          
  其他


It is a combinatorial problem with great significance in practics to obtain the bandwidth of a graph. However, it has been shown that algorithmic determination of the bandwidth of a graph is an NP-complete problem even for a tree. So it is attractive to get thc bandwidths of some special, classes, of graphs.In 1976, Dewdney announced in a survery, that the bandwidth of the discrete tori Cm × Cn is an unsolved problem. In this paper, we has solved this problem, i.e., we obtain the following results:Theorem 1....

It is a combinatorial problem with great significance in practics to obtain the bandwidth of a graph. However, it has been shown that algorithmic determination of the bandwidth of a graph is an NP-complete problem even for a tree. So it is attractive to get thc bandwidths of some special, classes, of graphs.In 1976, Dewdney announced in a survery, that the bandwidth of the discrete tori Cm × Cn is an unsolved problem. In this paper, we has solved this problem, i.e., we obtain the following results:Theorem 1. If m≠n and min(m, n)≥3, then the bandwidth of the discrete tori Cm×Cn is 2 min(m, n);Theorem 2. If n≥3, then the bandwidth of the discrete tori Cn×Cn is 2n-1,

求一个图(Graph)——或一个对称矩陣——的带宽(Band width)是一个很有实际意义的組合問題。已經証明,即使对于树形图(Tree)来說,确定它的带宽問題也属于NP—完全类。因此,求出一些特殊类型的图的带宽就更加引人注目。事实上,能够定出其带宽的图很少。除了一些很簡单的情形外,迄今已知的主要結果只有完全偶图K_(m:n)、n維方体Q_n、平面格子图P_m×P_n和柱面上的格子图C_m×P_n。Dewdney在1976年所作的关于图的带宽的一篇綜述报告中,提出了三个沒有解决的問题。其中一个是求环面上格子图C_m×C_n的带宽。本文解决了这个問題,我們得到下述結果: 定理1.当m≠n且min(m,n)≥3时,环面上格子图C_m×C_n的带宽为2min(m,n); 定理2.当n≥3时,环面上格子图C_n×C_n的带宽为2n—1.

This paper difines the Simple Boolean Expressions (SBE) built on the Adequate Set of Connectives { } and its hierarchy structure is very simple. It is proved that the SEE' satisfiability is solvable in the polynomial time by means of giving a concrete deterministic Turing Machine. Thus, the subset of satisfiability problem that originally belongs to the Class NP-Completeness is demonstrated to be belonging to the Class P.

本文定义了一种建立在联结词完备集{,∨,∧}上的、层次结构简单的单纯型布尔表达式(SBE)。通过给出具体的确定型图林机,证明了SBE的可满足性(SAT)问题在多项式时间内可解。从而,把原来属于NP-完全类的SAT问题的一个子集,划入了P类。

M. R. Garey and D. S. Johnson introduced the concept of Turing reduction and by using this concept intended to make the theory of NP-completeness applicable to an extended class of problems including the combinatorial optimal problems in [3]. They gave the formal definition of Turing reduction in terms of oracle Turing machine (OTM). But there is a mistake in this formal definition given in [3]. We point out this mistake and correct it in this paper.

M.R.Garey和D.S.Johnson在[3]中引入“图灵归约”的概念,利用这个概念把NP完全性理论推广到包括组合最优化问题在内的更广的一类问题上。他们用oracle图灵机(OTM)模型给出了图灵归约的形式定义。但是,[3]中给出的这个形式定义是错误的。本文指出了这个错误并给出修正。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关np-完全的内容
在知识搜索中查有关np-完全的内容
在数字搜索中查有关np-完全的内容
在概念知识元中查有关np-完全的内容
在学术趋势中查有关np-完全的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社