The Computational Complexity of Knot Genus and Spanning Area

Details The Computational Complexity of Knot Genus and Spanning Area The Computational Complexity of Knot Genus and Spanning Area

2002-05-06

arxiv.org/abs/math/0205057v2

Mathematics

Geometric Topology

This is a revised version of the previous posting, with many minor clarifications and improvements. 29 pages, 5 figures. To ap

Scientific paper

We investigate the computational complexity of some problems in
three-dimensional topology and geometry. We show that the problem of
determining a bound on the genus of a knot in a 3-manifold, is NP-complete.
Using similar ideas, we show that deciding whether a curve in a metrized PL
3-manifold bounds a surface of area less than a given constant C is NP-hard.

Affiliated with

Also associated with

No associations

Rating

The Computational Complexity of Knot Genus and Spanning Area does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Computational Complexity of Knot Genus and Spanning Area, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Computational Complexity of Knot Genus and Spanning Area will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-497319