A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number.
Clément MariaJonathan SpreerPublished in: CoRR (2016)
Keyphrases
- computational complexity
- worst case
- cost function
- dynamic programming
- optimization algorithm
- polynomial time complexity
- randomized algorithm
- learning algorithm
- space complexity
- preprocessing
- k means
- linear programming
- memory requirements
- matching algorithm
- detection algorithm
- np hard
- optimal solution
- similarity measure
- expectation maximization
- probabilistic model
- approximation ratio
- polynomial time approximation