|Nice Answer||Answer score of 10 or more. This badge can be awarded multiple times.|
Pratik Deoghare earned this badge 5 times
may 10 at 6:47What papers should everyone read?
feb 25 '12 at 10:02Concepts in theoretical CS that would be approachable ages 8-14
jan 11 '12 at 2:13Explain P = NP problem to 10 year old
jan 9 '11 at 5:48Is there a polynomial-time algorithm to solve graph isomorphism for Delaunay graphs of (finite) hexagonal tessellations?
oct 21 '10 at 16:35What papers should everyone read?