Constraint satisfaction problems (CSPs) play a central role in the real world and in computer science. CSPs are in general NP-hard and a general deterministic polynomial time algorithm is not known. CSPs with finite domains for the variables (finite constraint satisfaction problems) are considered. They (and all NP-complete problems) can be reduced in polynomial time to the satisfaction of a
Angelo Monfroglio hasn't uploaded this paper.
Create a free Academia account to let Angelo know you want this paper to be uploaded.
