On 9/20/2012 12:22 AM, Stephen P. King wrote:
Any one up to explaining this:

http://www.qmul.ac.uk/media/news/items/se/38864.html


What's to explain? The bees found the shortest route. Do you suffer from the misconception that NP-hard = insoluble? NP is just a description of how a computation scales. For the number of places bees visit it may be very easy to solve, even though the number of steps grows faster than polynomially with the number of places to visit.

Brent

--
You received this message because you are subscribed to the Google Groups 
"Everything List" group.
To post to this group, send email to everything-list@googlegroups.com.
To unsubscribe from this group, send email to 
everything-list+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/everything-list?hl=en.

Reply via email to