Converse of object

• return: IsomorphismFpGroup returns an isomorphism to this new group, given by the preimages of the new generators.

• test: This module contains an algorithm to test isomorphism of pc groups using a random method.

• find: The larger the integer is, the larger is the probability of finding all isomorphisms.

• define: As long as t y never equals 1 this defines a unique order isomorphism from X into [ 0,1 ] .

Preposition: between

• language: They are important in particular because of their views concerning the strong isomorphism between language and reality.

• group: Hence the probability that there are still isomorphisms between groups in this list is less than 2 -100.

Adjective modifier

• institutional: The case study was guided by the social science concepts of institutional isomorphism and resource dependency.

• partial: This relation can, first of all, be characterized in terms of the notion of partial isomorphism.

• structural: These and a few further structural isomorphisms lead to tensor algebra ( see next combinator ).

Modifies a noun

• theorem: Karp's partial isomorphism theorem was first proved in Karp [ 1965 ] ; see also Barwise [ 1973 ] .

• algorithm: We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the TOPS descriptions of protein structure.

• type: In general, it will change the isomorphism type of the group defined by P.

• class: Write a, b for typical well-ordered subsets of R and [ a ] , [ b ] for their isomorphism classes.

• problem: Another problem, known as the graph isomorphism problem, involves trying to decide whether two graphs are the same.

• test: Typical examples are ( without any claim toward completeness ): Isomorphism tests, Calculation of all subgroups, Calculations with finitely presented structures.

Noun used with modifier

• subgraph: We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the TOPS descriptions of protein structure.

• graph: The retrieval searches for graph isomorphism among these attribute graphs.

• group: Therefore it is not closed under group isomorphisms, hence is not a group class.

Preposition: of

• group: This module contains an algorithm to test isomorphism of pc groups using a random method.

• thought: Most importantly, it reveals that the notion of Labor incorporates an isomorphism of thought and the object of thought.