Testing homotopy equivalence is isomorphism complete (Q1072577)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Testing homotopy equivalence is isomorphism complete |
scientific article; zbMATH DE number 3941597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Testing homotopy equivalence is isomorphism complete |
scientific article; zbMATH DE number 3941597 |
Statements
Testing homotopy equivalence is isomorphism complete (English)
0 references
1986
0 references
A problem is called isomorphic complete if it is polynomially equivalent to the problem of deciding whether two given graphs \(X\) and \(Y\) are isomorphic or not. In this communication is shown an example of nontrivial equivalence between the problem of testing homotopy equivalence of two finite topological spaces and the isomorphism problem.
0 references
isomorphism of graphs
0 references
polynomial equivalence
0 references
homotopy equivalence
0 references
0 references
