Why are CSPs Based on Partition Schemes Computationally Hard?.

Peter Jonsson Victor Lagerkvist

Published in: MFCS (2018)

Keyphrases

computationally hard
constraint satisfaction problems
np hard
efficiently computable
search space
constraint programming
bayesian networks
cooperative
probability distribution