Re:GetACoder.com: Solve P Vs NP
by someone_here on Monday August 16, 2010 @08:29AM
(#1607557)
This could be said about almost all "polynomial time" algorithms though. The bigger the loop, the larger the variables you'll need (in general), and the more time you'll need to communicate between the pieces.
[ Parent
| on HN ]
Re:GetACoder.com: Solve P Vs NP
by cynicalkane on Monday August 16, 2010 @09:53AM
(#1607767)
OK, but the amount of data you need to access will be bounded by a polynomial...