I believe August 16, 2020 is the 10th anniversary of CSTheory, also known as TCS.se.

What are some Questions and Answers (and Comments?) that you remember fondly, or want to bring attention back to, from the decade that was?


My favorite is How hard is unshuffling a string?

It is attractive because it is very simple to state yet has many equivalent formulations. It illustrates a puzzling feature of perfect matching problem (efficiently solvable) where imposing some restrictions turns the problem into an intractable one.

  • 1
    $\begingroup$ Didn't know about that one but now I think it's my favorite too. $\endgroup$ – Bjørn Kjos-Hanssen Jul 27 '20 at 20:28

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .