3-MANIFOLD KNOT GENUS is NP-complete.
Ian AgolJoel HassWilliam P. ThurstonPublished in: Computational Complexity Conference (2002)
Keyphrases
- np complete
- np hard
- randomly generated
- computational complexity
- low dimensional
- satisfiability problem
- b spline
- manifold learning
- phase transition
- high dimensional
- constraint satisfaction problems
- euclidean space
- np complete problems
- lower dimensional
- conjunctive queries
- manifold embedding
- control points
- data complexity
- manifold structure
- fisher information
- polynomial time complexity
- conp complete
- bounded treewidth
- pspace complete
- riemannian manifolds
- geodesic distance
- semi supervised learning
- feature space