News for hackers. Stuff that matters.

A comment on A story of the rise and fall of a serious attempt at a proof that P!=NP. Parent comment

Re:A story of the rise and fall of a serious attempt at a pr... by sp332 on Thursday August 20, 2009 @01:56PM (#775651)
Longer explanation, with pictures: http://en.wikipedia.org/wiki/Hadwiger%E2%80%93Nelson_problem
[ Parent | on HN ]
Re:A story of the rise and fall of a serious attempt at a pr... by endtime on Thursday August 20, 2009 @02:05PM (#775671)
Thanks, but as far as I can tell that still doesn't actually answer my question.
[ Parent | on HN ]
Re:A story of the rise and fall of a serious attempt at a pr... by rottencupcakes on Thursday August 20, 2009 @02:17PM (#775713)
http://www.ics.uci.edu/~eppstein/junkyard/geom-color.html

Yes, there are an infinite number of points at a distance 1 from the original point. However, that doesn't matter for the problem.

All you want to do is color regions of the plane such that, for any given point, every point a unit away is in a different colored region.

[ Parent | on HN ]
Re:A story of the rise and fall of a serious attempt at a pr... by endtime on Thursday August 20, 2009 @06:25PM (#776486)
Ah, right. Not sure why your wording clicked for me (or, rather, I'm not sure why I was being dense before), but makes sense now. Thanks.
[ Parent | on HN ]