Posts Tagged ‘computer science’
Origami crease-patterns are NP-complete
Tuesday, July 31st, 2007After talking about it with someone I met, I looked it up, and it does seem to be so. There is of-course a lot of research on the subject that I didn’t yet get the chance to read, but I think this is the general picture.
In any case, this shows that my suggestion of using origami as a hash function is valid! Really cool stuff… I wonder if it could actually be useful somewhere.
Misunderstood humour – and NP-Completeness
Wednesday, July 18th, 2007One of the good xkcd comics that I liked. I tried showing it to other people, but almost nobody got it…
