查询词典 spatial isomorphism

In section four, we consider a normal π-subgroup in π-separable group, a normal set and a complex value class function space defined on G, using the B_π-character theory and character-triple isomorphism, and find a classical basis of this space such that it behaves as the set of irreducible Brauer characters, and satisfies the Fong-Swan property.

在第四节中我们考虑了π-可分群G中的一个正规π-子群，以及定义在G上的一个正规集和它上面的一个复值类函数空间，利用B_π-特征标理论和特征三元组同构，我们找到了这个空间的一个经典基，使得这个基具有类似于不可约Brauer特征标的集合的性质，并且满足Fong-Swan性质。

To show that two graphs are isomorphic one must indicate an isomorphism between them.

要证明两个图是同构的，就必须指出它们之间的一个同构。

A set of graphs isomorphic to each other is called an isomorphism class of graphs.

一套图同构对方被称为同构类的图表。

For example, if a graph has exactly one cycle, then all graphs in its isomorphism class also have exactly one cycle.

"这一概念图同构"使我们能够区分图形性能固有的结构图自己从性能与图申述：图图，数据结构的图形，图表标号等例如，如果一个图，正是一个周期，然后在其所有图形类也有同构的一个周期。

There are a number of classes of mathematical objects for which the problem of isomorphism is a GI-complete problem.

有一些类型的数学对象的问题，这是一个同构起完整的问题。

A generalization of the problem, the subgraph isomorphism problem, is known to be NP-complete.

一般化的问题，子图同构问题，是已知的NP完全问题。

The decision problem of isomorphism for trees is solvable in linear time.

树同构的判定问题在线性时间内是可解的。

We researched the number problem of isomorphism classes of finite groups with given element orders.

研究了"元的阶之集"为某些给定数量集的有限群同构类的类数问题。

Graph isomorphism problem is one of the problems that have not been classified as NP complete, or within P.

根据图同构国内外目前的研究进展，图同构既未被归入P问题，也未被归入NPC问题，是一个尚未解决的问题，有待进一步研究。

The graph isomorphism problem is contained in both NP and co-AM.

该图同构问题，载于NP和双方共同上午。

Connectors are lines that can be anchored to particular places, called glue points , on the graphic object.

连接符，可固定在图形对象的特定的地方的线条。

Another way of putting it, too many agents have a say in each other's work, and bureaucratic rigor mortis sets in.

另一种表达是，太多的作用物在彼此的工作里都有话语权，官僚的僵尸开始抬头。