Re:What would a computer engineer Barbie look like?
by rdtsc on Tuesday January 12, 2010 @12:45PM
(#1048032)
Good idea. Instead of "Math is hard" she would blurt out "A finite graph is planar if and only if it does not contain a subgraph that is homeomorphic to K5 or K3,3"
[ Parent
| on HN ]
There are no comments on this comment yet.