Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
user avatar
user avatar
user avatar
C.P.
  • Member for 8 years, 9 months
  • Last seen more than a month ago
6 votes
0 answers
158 views

Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$

  • 685
6 votes
2 answers
361 views

On the complexity of a "list" datastructure in the RAM model

  • 685
11 votes
0 answers
343 views

A dynamic data structure to list triangles

3 votes
0 answers
61 views

AMQ (Bloom-filter like structure) lower bounds

  • 125
7 votes
1 answer
175 views

Arranging letters to make a word in a regular language

  • 7,350
9 votes
0 answers
109 views

Graphs with minimal-size induced subgraphs

  • 7,350
9 votes
0 answers
116 views

Expected value of the evaluation of Boolean circuits of depth $2n$

  • 4,721
23 votes
2 answers
538 views

Testing whether letters can be scheduled to achieve a word in a regular language

  • 7,350
17 votes
0 answers
486 views

What if an $\mathsf L$-complete problem has $\mathsf{NC}^1$ circuits? More generally, what evidence is there against $\mathsf{NC}^1=\mathsf{L}$?