Follow Slashdot stories on Twitter

 



Forgot your password?
typodupeerror
Image

Pancake Flipping Is Hard — NP Hard 260 260

mikejuk writes "French computer scientists have finally proved that sorting pancakes is hard — NP hard. No really — this isn't a joke. Well, it is slightly amusing but that's just because it is being presented as pancake flipping. The algorithm in question is sorting a permutation using prefix reversal — which is much easier to understand in terms of pancakes. Basically you have to sort a pancake stack by simply inserting your spatula and flipping the top part of the stack. We now know that if you can do the this in polynomial time then you have proved that P=NP."
This discussion has been archived. No new comments can be posted.

Pancake Flipping Is Hard — NP Hard

Comments Filter:

Never ask two questions in a business letter. The reply will discuss the one you are least interested, and say nothing about the other.

Working...