Computation in 3-manifold topology
by
Sergei V. Matveev
Chelyabinsk State University

Recent development of algorithmic topology has shown that the problem of finding out an efficient (it means working) algorithm for solving a geometric problem may serve as a well-defined goal of research. Trying to achieve it, we can often get new deep results that have a purely theoretical nature. I'll describe some examples that confirm this claim. Among them: outlines of complexity theory of 3-manifolds, algorithmic recognition of Haken manifolds, computer classification of genus 2 manifolds.

Date received: August 11, 1999

Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacy-53.