NEWS
Unshuffling A Square Is NP-Complete
Written by Mike James   
New NP complete problems are always interesting because they broaden our conception of what is difficult to compute. Now we have a new result that unshuffling square strings is NP-Hard.
Shared publiclyView activity