Miscellaneous topological algorithms.

These notes review some techniques of computational topology and include a few original results. Topics covered include classificaltion of 2-complexes, cohomological obstructions to embedding of 2-complexes, and in-groups associated with embeddings, with a glance at computational synthetic geometry. The most significant original result is that homeomorphism of finite 2-complexes is computationally equivalent to graph isomorphism. There are also some sufficient conditions given for embeddability of 2-complexes in 3-space.