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
Stella Biderman
  • Member for 8 years, 2 months
  • Last seen more than a month ago
15 votes

Most important new papers in computational complexity

14 votes

What are theoretical computer science jobs?

11 votes

Most important new papers in computational complexity

6 votes

What are graph grammars?

5 votes

Everyday encounters with NP-complete problems

5 votes

How to cite Babai's new graph isomorphism result?

5 votes

Where can I seek help when I cannot understand a research paper?

5 votes
Accepted

What does "hold uniformly" mean in the context of asymptotic analysis?

4 votes

Example where equivalence is easy but finding class representative is hard

2 votes

Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)

1 vote

Common terminology used for lower/upper bounds

1 vote

Constraint terminology

1 vote

How to continue this algorithm?

0 votes

Complexity class on quantum computation and classic ones

0 votes

Is the unbounded fan-in model realistic?

0 votes
Accepted

What is the practical importance of making or using a Turing complete language?

0 votes

An (unusual?) risk bound