- Isomorphism problem
The isomorphism problem in
mathematics may refer to* The
graph isomorphism problem
* Thegroup isomorphism problem
Wikimedia Foundation. 2010.
Isomorphism problem
Look at other dictionaries:
Subgraph isomorphism problem — In complexity theory, Subgraph Isomorphism is a decision problem that is known to be NP complete. The formal description of the decision problem is as follows.Subgraph Isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: Is G1 isomorphic to … Wikipedia
Induced subgraph isomorphism problem — In complexity theory and graph theory, induced subgraph isomorphism is an NP complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.Formally, the problem takes as input two graphs G 1=( V 1, E 1)… … Wikipedia
Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… … Wikipedia
Group isomorphism problem — In abstract algebra, the group isomorphism problem is the decision problem of determining whether two group presentations present isomorphic groups.The isomorphism problem was identified by Max Dehn in 1911 as one of three fundamental decision… … Wikipedia
Isomorphism — In abstract algebra, an isomorphism (Greek: ἴσος isos equal , and μορφή morphe shape ) is a bijective map f such that both f and its inverse f −1 are homomorphisms, i.e., structure preserving mappings.In the more general setting of category… … Wikipedia
Problem of evil — Part of a series on God General conceptions … Wikipedia
Graph isomorphism — In graph theory, an isomorphism of graphs G and H is a bijection between the vertex sets of G and H such that any two vertices u and v of G are adjacent in G if and only if ƒ(u) and ƒ(v) are adjacent in H. This kind of bijection is commonly… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Hidden subgroup problem — The hidden subgroup problem (HSP) is a topic of research in mathematics and theoretical computer science. Problem statementGiven a group G , a subgroup H ≤ G , and a set X , we say a function f : G → X separates cosets of H if for all g 1, g 2 ∈… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
