  This paper investigates sufficient and necessary conditions for the existence
of a homotopy equivalence between two finite simplicial complexes from an
algorithmic point of view. As a result, the conditions are formulated in terms
of the underlying data of Postnikov towers for simplicial sets with so-called
effective homology.
