Titlebook: Algorithmic Topology and Classification of 3-Manifolds; Sergei Matveev Textbook 2007Latest edition Springer-Verlag Berlin Heidelberg 2007

細絲

FACET

,über Schornstein, Saugzug und Unterwind,n in .. It would be desirable to have a finite number of 3-manifolds in each term of the filtration, all of them being in some sense simpler than those in the subsequent terms. A useful tool here would be a measure of “complexity” of a 3-manifold. Given such a measure, we might hope to enumerate all

哄騙

Cumulus

Der Prototyp des Dandys: George B. Brummell,s based on that method have exponential complexity and hence are impractical. In particular, although the recognition problem for Haken manifolds has an algorithmic solution, there is no chance of it being be realized by a computer program, at least in the foreseeable future. On the other hand, quit

condemn

來自于

Observe

Algorithmic Topology and Classification of 3-Manifolds

憂傷

PUT

3-Manifold Recognizer, an algorithm at all in the formal meaning of this term). The problem of finding an efficient partial algorithm for answering a particular class of geometric questions is in itself a well-stated mathematical problem. Trying to solve it, we inevitably discover new structural properties of geometric objects.

連鎖,連串

1431-1550 t topics in algorithmic 3-dimensional topology, culminating with the recognition procedure for Haken manifolds and including the up-to-date results in computer enumeration of 3-manifolds. Originating from lecture notes of various courses given by the author over a decade, the book is intended to com