PSPACE-hardness of variants of the graph coloring game.
Carlos V. G. C. LimaThiago MarcilonNicolas Almeida MartinsRudini M. SampaioPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- graph coloring
- phase transition
- combinatorial problems
- job shop scheduling
- np complete problems
- constraint satisfaction
- satisfiability problem
- constraint satisfaction problems
- max sat
- game playing
- randomly generated
- scheduling problem
- temporal logic
- np complete
- optimization algorithm
- artificial bee colony
- cost function
- computational complexity
- constraint programming
- min max
- search procedures
- search space
- neural network