Origami crease-patterns are NP-complete

After 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.

This entry was posted in computer science, Math, Origami, Protocols and tagged , , . Bookmark the permalink.

One Response to Origami crease-patterns are NP-complete

  1. Amit says:

    Hi Imri, glad to know i had a little contribution to this blog. Sorry it took me time to view it, but i think it’s amazing. I’ll get digging in when I have the time, promise :-)