查询词典 Np

Subgraph isomorphism is NP-Complete problem. So must avoiding subgrph isomorphism by canonical code and efficient algorithm.

因此，必须有个好的规范化编码和有效的算法来避免子图同构这个难题。

Since the graph isomorphism problem is neither known to be NP-complete nor to be tractable, researchers have sought to gain insight into the problem by defining a new class GI, the set of problems with a polynomial-time Turing reduction to the graph isomorphism problem.

由于图同构的问题既不是已知的NP完全问题，也不是听话的，研究人员设法深入了解这个问题，确定了一类新基的一系列问题，多项式时间图灵减少的图同构问题。

Then, by taking the local features provided by users as portions of the AAG, and the whole CAD model as the whole AAG, the problem of local feature matching is transformed into that of subgraph isomorphism. Subgraph isomorphism is a NP-complete problem.

在局部匹配过程中，用户输入的局部结构被表示成"子图"，待匹配的整体CAD模型被表示成"大图"；则在整体CAD模型中，检索局部结构的问题就被转换成在"大图"中寻找同构"子图"的问题。

The Subgraph Isomorphism problem is NP-complete.

一个满足条件2但不满足条件1的问题被称为

Graph's isomorphism is one of the basic problems and NP problems in graph theory.

图的同构是图论学科中的基本问题之1，属于图论中多个NP—完全问题之1。

In fact, one of these was among Karp's original 21 NP-complete problems.

事实上，这些是斯卡普原来21 NP完全问题。

Karp introduced the now standard methodology for proving problems to be NP-complete which has led to the identification of many theoretical and practical problems as being computationally difficult.

Karp 的方法使得许多理论和实际问题被确认为从可计算性角度而言是复杂的或困难的。

Methods. Left L5 partial laminectomy was performed and NP was applied to the L5 nerve root in 24 rats.

研究方法：共24鼠，切除腰5左侧部分椎板，用髓核压迫L5神经根。

R and S type LTSs are proposed.It is proved that the optimal distributed CFAR detection based on the above two LTSs in NP sense is in form of likelihood ratio test.

提出了R类和S类局部检测统计量，证明了基于这两种局部检测统计量的在NP意义上的最优分布式CFAR检测具有似然比检验形式。

A linear map f: M→M is said to preserve idempotence if fP(subscript nP.

若线性映射f： M→M满足fP(下标 nP，则称f是保幂等的线性映射。

Mainly in a method of the lattice vector quantifying coding and decoding, a new basic code book is selected out and directly or indirectly comprises all points whose value is less than or equal to 3 of any dimension in a RE point set, and points on a fourth grade hypersphere in the basic code book are all odd points so that part of nearest adjoint point values can be comprised in the basic code book only via corresponding odd number processing.

一种格矢量量化编解码的实现方法及装置，其主要是在格矢量量化编码方案中，选定新的基础码本，在该基础码本中直接或间接地包含了RE 8 点集中任意维的数值小于等于3的所有点，且该基础码本中的第4级超球面上的点全部为奇数点，以使得部分的最近邻点数值仅经过相应的奇数化处理便可以包含于基础码本中。

I do want more but I am willing to settle.

我想要更多，但我愿意解决。