4 ms·General constraint satisfaction problem is NP-hard.by coarise 1y agoGeneral constraint satisfaction problem is NP-hard.