A bounded-error quantum polynomial-time algorithm for two graph bisection problems.
Ahmed YounesPublished in: Quantum Inf. Process. (2015)
Keyphrases
- polynomial time complexity
- computational complexity
- worst case
- np complete
- graph structure
- probabilistic model
- benchmark problems
- np hard
- k means
- detection algorithm
- minimum spanning tree
- iterative algorithms
- np hardness
- simulated annealing
- dominating set
- tree structure
- shortest path problem
- planar graphs
- deterministic domains
- approximation ratio
- linear programming problems
- particle swarm optimization
- linear programming
- graphical models
- search space