English Wikipedia - The Free Encycl...
Download this dictionary
Complexity of constraint satisfaction
The
complexity of constraint satisfaction
is the application of
computational complexity theory
on
constraint satisfaction
. It has mainly been studied for discriminating between tractable and
intractable
classes of
constraint satisfaction problems
on finite domains.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License