Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem.
Junpeng ZhanPublished in: CoRR (2023)
Keyphrases
- np complete
- randomly generated
- np hard
- constraint satisfaction problems
- pspace complete
- undirected graph
- satisfiability problem
- conjunctive queries
- computational complexity
- active learning
- np complete problems
- quantum computing
- phase transition
- unsupervised learning
- image labeling
- channel capacity
- quantum inspired
- quantum computation
- directed graph
- data complexity
- learning algorithm
- quantum mechanics
- probability ranking principle