Badge
| 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:47
What papers should everyone read?
feb 25 '12 at 10:02
Concepts in theoretical CS that would be approachable ages 8-14
jan 11 '12 at 2:13
Explain P = NP problem to 10 year old
jan 9 '11 at 5:48
Is there a polynomial-time algorithm to solve graph isomorphism for Delaunay graphs of (finite) hexagonal tessellations?
oct 21 '10 at 16:35
What papers should everyone read?
