|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |
Constraint Satisfaction is NP complete. The means that very smart people have worked for 100 years or so in order to find a polynomial time algorithm and failed. It is thus very unlikely that AI researchers would stumble across a polynomial time algorithm.
|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |