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

图标索引 历史查询
 

np完全性     
相关语句
  np-completeness
    DISCUSSION OF NP-COMPLETENESS OF TABLE EQUIVALENCE
    表的等价性的NP完全性的讨论
短句来源
    And it displays the essence of DDM by researching on DDM's formalization, comparison about previous specification, algorithm computational complexity and NP-completeness.
    最后通过形式化描述、与先前规范的比较、算法复杂度和NP完全性的研究,深刻地揭示出数据分发管理的本质。
短句来源
    In this paper, several results of table equivalence decision are given:3-satisfiability problem, expression NP-completeness, and table NP-completeness.
    本文给出了表的等价性判定的一些结果:三元可满足性问题、表达式的NP完全性、表的NP完全性,还给出了函数依赖对表的影响、强等价性的复杂性的一些讨论。
短句来源
  np-completeness
    DISCUSSION OF NP-COMPLETENESS OF TABLE EQUIVALENCE
    表的等价性的NP完全性的讨论
短句来源
    And it displays the essence of DDM by researching on DDM's formalization, comparison about previous specification, algorithm computational complexity and NP-completeness.
    最后通过形式化描述、与先前规范的比较、算法复杂度和NP完全性的研究,深刻地揭示出数据分发管理的本质。
短句来源
    In this paper, several results of table equivalence decision are given:3-satisfiability problem, expression NP-completeness, and table NP-completeness.
    本文给出了表的等价性判定的一些结果:三元可满足性问题、表达式的NP完全性、表的NP完全性,还给出了函数依赖对表的影响、强等价性的复杂性的一些讨论。
短句来源
  np-complete
    A special kind of scheduling problem, the precedence constrained crane scheduling problem, is introduced and shewn NP-complete.
    本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性
短句来源
    We introduce a NP-complete problem named RHC and prove its NP─complete property in this paper.
    本文提出一个构造的NP完全问题RHC并证明其NP完全性
短句来源
    The Graph Search problem is proved to be NP-complete by MEGIDDO et al. An algorithm for tree is also proposed by them which computes the search number in O(n) time and the search plan in O (nlog (n) ) time. This paper developes a linear algorithm through representing a search plan by edge sequence, which computes both the search number and the search plan in O(n) time.
    MEGIDDO等人证明了图搜索问题的NP完全性并给出一个树图上的算法,可在O(n)时间内求解树的搜索数,在O(nlog(n))时间内求解树搜索方案.本文通过引入搜索方案边序表示法给出一个线性算法,可在O(n)时间内同时求得树的搜索数和搜索方案.
短句来源
  “np完全性”译为未确定词的双语例句
    The traveling salesman problem is a typical NP problem.
    旅行商问题是一个典型的NP完全性问题。
短句来源
    This paper describes the parameters selection and the coding method, fitness function design, population’s initialization and genetic operators’ design in the program of resolving the TSP using the improved genetic algorithm.
    文中给出了遗传算法在解决TSP问题中的参数选择和编码方式、适应度函数的设计、种群的初始化和遗传算子的详细设计。 通过对此程序的改装,即可用于其他NP完全性问题的求解。
短句来源
    Packing problem is a typical combinatorial optimization problem, and has NPC difficulty in solving complexity.
    布局问题是一种经典的组合优化问题,在求解复杂性上具有NP完全性
短句来源
    A formal definition of the CDS (F) is firstly given,whose NP property is then proved in variant situations. We also present an approximation algorithm with approximation ratio LnΔ+3(Δ is maximal degree of the vertex in our concerned graph).
    文中首先给出问题的形式定义,证明了它在各种情形下的 NP 完全性,并给出多项式时间的近似算法,它的近似度为 Ln△+3(△为图中顶点的最大度数)。
短句来源
查询“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-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 completeness
A Gentzen-style hypersequent calculus is provided for CRL and used to establish co-NP completeness results for these logics.
      
Due to NP completeness of cell formation problem, many heuristics have been developed.
      
Computers and Intractability, A guide to the theory of NP Completeness.
      
The rest of the proof follows standard proofs of NP completeness.
      
  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.
      
更多          
  其他


The research on the theory of NP-completeness is a new topic appeared in mathematics and comPuterscie.ace areas in the early 1970's, and is PerhaPs the most important theoritical development in algorithms research in the Past decade. Firstly, the article briefly introduces the concept of NP-comPlete Problem and other relative concepts and theory. Then, it gives several basic and Practical examPles of NP-complete Problems. Finally, the article discusses the significance of researching into the theory of NP-completeness....

The research on the theory of NP-completeness is a new topic appeared in mathematics and comPuterscie.ace areas in the early 1970's, and is PerhaPs the most important theoritical development in algorithms research in the Past decade. Firstly, the article briefly introduces the concept of NP-comPlete Problem and other relative concepts and theory. Then, it gives several basic and Practical examPles of NP-complete Problems. Finally, the article discusses the significance of researching into the theory of NP-completeness.

关于NP-完全性理论的研究是七十年代初在数学和计算机科学领域里出现的一个新课题,也是近十几年来在算法理论研究中取得的重大成果。本文试图对NP-完全问题以及有关概念和理论做一粗浅的介绍,并给出几个较基本、通俗的NP-完全问题实例。最后,文章着重指出了研究NP-完全性理论的意义。

Current understanding of the PLA folding problem is limited to the simple empirical evidence coming from heuristic methods, and it is difficult to measure the relative effectiveness of various algorithms. This paper systematically states the foundamental theory of the PLA folding problem. Both set and graphic descriptive manners are given and many basic concepts are set up. Section 3 demonstrates the basic properties of the folding problem and gives a simple and vigorous method to show that the problem is NP-Complete....

Current understanding of the PLA folding problem is limited to the simple empirical evidence coming from heuristic methods, and it is difficult to measure the relative effectiveness of various algorithms. This paper systematically states the foundamental theory of the PLA folding problem. Both set and graphic descriptive manners are given and many basic concepts are set up. Section 3 demonstrates the basic properties of the folding problem and gives a simple and vigorous method to show that the problem is NP-Complete. These results are important to future research.

PLA折迭问题一直深受人们的关注和重视.目前,对PLA折迭问题的理解仅限于来自“试探法(heuristics)”的研究的简单经验事实,这方面的理论工作非常少,难以衡量各种算法的相对有效性.这篇文章全面、系统地阐述了PLA折迭问题的基本理论,给出了问题的集合和图论两种描述方式,建立了许多最基本的概念,还严格论证了PLA折迭问题的基本性质,尤其对PLA折迭的NP-完全性给出了一种既简单又严格的证明方法.这些基本理论对于今后的研究工作有着重要的指导意义.

A special kind of scheduling problem, the precedence constrained crane scheduling problem, is introduced and shewn NP-complete.

本文提出了计算机辅助制造(CAM)中的一类作业调度问题并证明了它的NP完全性

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

 


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

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