Singpolyma

Stephen Paul Weber posted, “Prof sez: in AI, NP-hard problems are easy. # #@ 2012-11 14:01 UTC

Leave a Response