No. | Title | Author | Year |
---|---|---|---|
1 | Solving the Rubik's Cube Optimally is NP-complete | Demaine, Erik D. et al. | 2018 |
2 | Who Needs Crossings? Hardness of Plane Graph Rigidity | Abel, Zachary et al. | 2016 |
3 | Algorithms for Designing Pop-Up Cards | Abel, Zachary et al. | 2013 |
4 | Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM | Cannon, Sarah et al. | 2013 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 4 |