Which is 'harder' - playing tetris, or cracking RSA?
- Given the cracking RSA encryption can be achieved by simply factoring, and
factoring is expected to not be NP-complete, we can conclude that Tetris is
harder, for, like Minesweeper, it has been proved to be NP-complete (by Erik
D. Demaine and his colleagues at the Massachusetts Institute of Technology.)
As you were.
(Paul - does this mean you're going to organise a distributed Tetris-playing
network? :-) )
First rule of Factor Club - you do not talk about Factor Club.
Second rule of Factor Club - you DO NOT talk about Factor Club.
Third rule of Factor Club - when the cofactor is prime, or you've trial-
divided up to the square root of the number, the factoring is over.
Do you Yahoo!?
HotJobs - Search new jobs daily now