Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

first of all, it's not P=NP - it would be NC=NP. If you nitpick, then at least do it right

and secondly, when "normal bloody people" talk about parallelizing, we don't mean exponential speedup - we mean using 4 cores in hopes of getting 3x time shrinking

and cube'n'conquer does exactly that - and have been the standard tool in SAT solving for forever



NC is a subset is P.

> mean using 4 cores in hopes of getting 3x time shrinking

I've already been over this: reducing 2^N by a factor of 3 is useless.


> I've already been over this: reducing 2^N by a factor of 3 is useless.

and here you're again showing your absence of practice and you being too much into theory

it's not useless if it transforms day computation into work-shift one

because actual people aren't working on theoretical infinite problems - people need solving specific examples they are stuck at

you sound like you'll enjoy working with galactic algorithms - too bad inter-universal beings aren't hiring right now




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: