Jigsaw puzzle with n pieces can be solved in O(n^2) time.
But if there can be ways of matching pieces that appear to work locally but fail globally, jigsaw puzzle is NP-complete.
11:03 AM - 6 Aug 2017
0 replies
1 retweet
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.