Skip to main content
Aaron Roth's user avatar
Aaron Roth's user avatar
Aaron Roth's user avatar
Aaron Roth
  • Member for 13 years, 8 months
  • Last seen more than 2 years ago
41 votes

What Books Should Everyone Read?

40 votes

What do you do when you cannot make progress on the problem you have been working on?

36 votes

What Books Should Everyone Read?

36 votes
Accepted

Is integer factorization an NP-complete problem?

27 votes
Accepted

Parameterized complexity from P to NP-hard and back again

25 votes
Accepted

Randomize or Not?

24 votes

What are the popular science books that inspire TCS?

23 votes

Importance of single author papers?

22 votes

Applications of TCS to classical mathematics?

21 votes
Accepted

Diameter of a graph with O(|V|) edges

20 votes

What is the difference between non-determinism and randomness?

20 votes
Accepted

How does Theoretical Computer Science relate to security?

19 votes

Polynomial-time algorithms with huge exponent/constant

17 votes

Everyday encounters with NP-complete problems

17 votes

Examples of pedantry in TCS

16 votes
Accepted

Simple question about decision problems

15 votes

Uses of algebraic structures in theoretical computer science

14 votes
Accepted

Statistical query model algorithms?

14 votes

Funny TCS-related papers etc?

14 votes
Accepted

Best alien communication protocol?

13 votes
Accepted

Is minimax problem NP-Hard when the inner problem is NP-Hard ?

13 votes

Are there NP-complete problems with polynomial expected time solutions?

13 votes

The importance of Integrality Gap

12 votes
Accepted

How do you go from insights to formal solutions?

12 votes
Accepted

What's the difference between online and incremental optimization?

12 votes

How hard is Mafia?

11 votes
Accepted

Understanding a Mechanism Design Proof

11 votes

Graduate studies (PhD) in CS Theory vs. Applied Math

11 votes
Accepted

External Regret and Nash Equilibrium

11 votes
Accepted

Is testing easier/harder than learning?