Testing homotopy equivalence is isomorphism complete (Q1072577): Difference between revisions

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.