查询词典 excision isomorphism

In this part, we mainly focus on some concepts such as integral domain, division ring, field, ideal, difference ring, isomorphism, homomorphism and anti-isomorphism.

本部分主要介绍整区、除环、域、理想、差环、同构、同态及反同态等基本概念。

In this chapter, firstly, the definition of rough semigroups is given afresh. Then based on rough groups, rough subgroups, rough cosets, rough invariant subgroups, some properties of rough subgroups and rough invariant subgroups and the concept of rough quotient groups are introduced. Finally, based on some concepts of homomorphism and isomorphism of rough groups, basic homomorphism theorem and isomorphism theorem of rough groups are put forward and proved.

在这一章中，首先重新给出了粗糙半群的定义，其次在粗糙群、粗糙子群、粗糙陪集、粗糙不变子群的基础上，给出了粗糙子群的若干性质、粗糙不变子群的三个重要性质和粗糙商群的定义，最后在粗糙群同态与同构的基础上，给出了粗糙群同态基本定理与同构定理。

It is proved that an R-algebra isomorphism between two integral table algebras must be an integral table algebra isomorphism if it is compatible with the so-called normalizings of the integral table algebras.

我们证明了两个整表代数之间的一个R-代数同构必是一个整表代数同构只要它与一种标准化变换相容。

In reference [15], Muhly discribe the isometric algebral isomorphism and isometric reflixive algebra isomorphism on some triangle subalgebra og Nenclear algebra with diagonent. The first problem of this chapter is analyzing furtherlythe concrete form of the isometry on TUHF algebra.

Muhly等在文献[15]中讨论了带有对角的Nuclear C~*-代数中的某些三角子代数上的等距代数同构和等距反代数问题，本章讨论的第一各方面就是借助于Muhly的结论进一步分析TUHF代数上等距的具体表达形式。

In this paper a new necessary and sufficient condition of graphic isomorphism is proved which is stated as following: two graphs are isomorphic if and only if their subgraphs are isomorphic and the new vertices as well as their adjancy edges are corresponding with the property of isomorphism.

提出了一个新的判定图同构的充分必要条件，即在子图同构的前提下，根据新增顶点及相应关联边的关系，判断母图同构的充分必要条件。

Graph isomorphism ; NP problem ; P problem ; NPC problem ; Graph isomorphism complete

图同构； NP问题； P问题； NPC问题；图同构完备

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模型中，检索局部结构的问题就被转换成在"大图"中寻找同构"子图"的问题。

At the same time, isomorphism for many special classes of graphs can be solved in polynomial time, and in practice graph isomorphism can often be solved efficiently.

与此同时，同构为许多特殊类别的图形就可以解决在多项式时间内，并在实践中图同构，往往可以有效地解决。

Yet, Edith says, there was always money in the bank.

但是Edith说，她的银行户口里面总是有钱。

We have created a series of files that resolve this problem--one for each day of the 40 days of purpose.

我们制作一系列的档案去解决这问题---一个为标竿40天中的每一天。