PSPACE-hardness of Two Graph Coloring Games.
Eurinardo Rodrigues CostaVictor Lage PessoaRudini Menezes SampaioRonan SoaresPublished in: LAGOS (2019)
Keyphrases
- graph coloring
- phase transition
- combinatorial problems
- constraint satisfaction
- np complete problems
- job shop scheduling
- np complete
- constraint satisfaction problems
- satisfiability problem
- randomly generated
- hyper heuristics
- max sat
- cellular automata
- temporal logic
- distributed constraint optimization problems
- game playing
- genetic programming
- scheduling problem
- neural network
- constraint programming
- orders of magnitude
- np hard
- lower bound