13
$\begingroup$

This is a placeholder question to collect instances where cstheory has been cited in papers. Hopefully as time goes in, this list will get longer.

Please answer in the format:

  • Question (and answer, if appropriate)
  • Cited in:

providing all links and citations necessary.

$\endgroup$
8
$\begingroup$

Instead of curating a list here (how current is this list, anyway?) we can happily delegate the work to the keeper of all data:

References to cstheory.SE on Google Scholar

$\endgroup$
  • $\begingroup$ nice. we were updating the list manually, but this seems to work as well. $\endgroup$ – Suresh Venkat Sep 28 '11 at 23:13
7
$\begingroup$

Question: How hard is unshuffling a string?

Cited in:

$\endgroup$
6
$\begingroup$

Question: Is optimally solving the n×n×n Rubik's Cube NP-hard?

Cited in: Algorithms for Solving Rubik's Cubes. Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, Andrew Winslow. arXiv:1106.5736v1

(Also pointed out in the question's answer by @Andy Drucker.)

$\endgroup$
6
$\begingroup$

Question: Post Correspondence Problem variant

Cited in: Levent Alpoge, Thomas Ang, Luke Schaeffer, Jeffrey Shallit (2011): Decidability and shortest strings in formal languages, Proc. DCFS 2011, LNCS vol. 6808, Springer. doi:10.1007/978-3-642-22600-7_5, arXiv:1103.1622

$\endgroup$

You must log in to answer this question.

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