• Skip to primary navigation
  • Skip to main content

Algorithm.co.il

  • About
  • Best Posts
  • Origami
  • Older Projects

Origami crease-patterns are NP-complete

Posted on 2007-07-31 by lorg 1 Comment

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.

Filed under: computer science, Math, Origami, Protocols

Reader Interactions

Comments

  1. Amit says

    2007-08-02 at 12:36 pm

    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 :-)

    Reply

Leave a Reply Cancel reply

© 2022 Algorithm.co.il - Algorithms, for the heck of it