A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number.
Clément MariaJonathan SpreerPublished in: SODA (2017)
Keyphrases
- computational complexity
- worst case
- detection algorithm
- optimization algorithm
- learning algorithm
- optimal solution
- preprocessing
- memory requirements
- times faster
- computational cost
- space complexity
- cost function
- dynamic programming
- polynomial size
- randomized algorithm
- geometric structure
- expectation maximization
- low dimensional
- linear programming
- np hard
- special case
- k means
- evolutionary algorithm
- search space
- objective function