user avatar
user avatar
user avatar
C.P.
  • Member for 8 years, 9 months
  • Last seen more than a month ago
2 answers
23 votes
537 views
4 bookmarks
Testing whether letters can be scheduled to achieve a word in a regular language
0 answers
17 votes
486 views
8 bookmarks
What if an $\mathsf L$-complete problem has $\mathsf{NC}^1$ circuits? More generally, what evidence is there against $\mathsf{NC}^1=\mathsf{L}$?
0 answers
11 votes
343 views
3 bookmarks
A dynamic data structure to list triangles
0 answers
9 votes
116 views
1 bookmarks
Expected value of the evaluation of Boolean circuits of depth $2n$
0 answers
9 votes
109 views
2 bookmarks
Graphs with minimal-size induced subgraphs
1 answer
7 votes
175 views
2 bookmarks
Arranging letters to make a word in a regular language
2 answers
6 votes
361 views
2 bookmarks
On the complexity of a "list" datastructure in the RAM model
0 answers
6 votes
158 views
2 bookmarks
Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$
0 answers
3 votes
60 views
2 bookmarks
AMQ (Bloom-filter like structure) lower bounds