A Polynomial-Time Algorithm to Compute Turaev-Viro Invariants $\mathrm {TV}_{4, q}$ of 3-Manifolds with Bounded First Betti Number.
Clément MariaJonathan SpreerPublished in: Found. Comput. Math. (2020)
Keyphrases
- computational complexity
- learning algorithm
- worst case
- cost function
- dynamic programming
- computational cost
- polynomial time complexity
- optimization algorithm
- memory requirements
- preprocessing
- randomized algorithm
- k means
- np hard
- particle swarm optimization
- detection algorithm
- optimal solution
- undirected graph
- convergence rate
- matching algorithm
- simulated annealing
- probabilistic model
- objective function
- search space
- expectation maximization
- neural network
- space complexity
- search algorithm
- strongly polynomial