Max
  • Member for 11 years, 2 months
  • Last seen more than a month ago
92 answers
375 votes
112k views
530 bookmarks
Algorithms from the Book.
11 answers
128 votes
11k views
62 bookmarks
How hard is unshuffling a string?
8 answers
79 votes
43k views
62 bookmarks
What would a very simple quantum program look like?
12 answers
71 votes
9k views
34 bookmarks
How important is knowing how to program for TCS?
33 answers
61 votes
4k views
20 bookmarks
Small steps for better TCS conferences?
1 answers
26 votes
695 views
5 bookmarks
Is there a regular tree language in which the average height of a tree of size $n$ is neither $\Theta(n)$ nor $\Theta(\sqrt{n})$?
2 answers
25 votes
5k views
6 bookmarks
Natural CLIQUE to k-Color reduction
2 answers
25 votes
887 views
7 bookmarks
Advice for attending my first TCS conference
1 answers
19 votes
677 views
3 bookmarks
What is the most general structure on which matrix product verification can be done in $O(n^2)$ time?
0 answers
13 votes
1k views
3 bookmarks
Is CFL strictly contained in NL?
1 answers
11 votes
646 views
3 bookmarks
What is the complexity of (possibly succinct) Nurikabe?
1 answers
10 votes
366 views
2 bookmarks
Is predicting (in the limit) computable sequences as hard as the halting problem?
3 answers
9 votes
326 views
4 bookmarks
Is there a generalization of information theory to polynomially knowable information?
1 answers
8 votes
301 views
1 bookmarks
Regular expressions of families of regular expressions
2 answers
7 votes
298 views
1 bookmarks
Rearranging strings to minimise storage in a trie
0 answers
6 votes
122 views
2 bookmarks
Fair and "robust" fallback permutations
0 answers
0 votes
177 views
2 bookmarks
Classification of Saturated LL(1) Grammars