Theoretical Computer Science
Ryan Williams's user avatar
Ryan Williams's user avatar
Ryan Williams's user avatar
Ryan Williams
  • Member for 12 years, 7 months
  • Last seen more than a week ago
Profile Activity
Stats
26,675
reputation
429k
reached
155
answers
6
questions
Communities
View all
About

algorithms/complexity extremist

Badges
View all badges
6
gold badges
111
silver badges
161
bronze badges
Top tags
View all tags
1,500
Score
90
Posts
56
Posts %
422
Score
27
Posts
17
Posts %
320
Score
28
Posts
17
Posts %
299
Score
21
Posts
13
Posts %
226
Score
14
Posts
9
Posts %
224
Score
19
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
481
What papers should everyone read?
Sep 12, 2010
question
111
Solid applications of category theory in TCS?
Sep 4, 2010
answer
88
Are $PSPACE$-complete problems inherently less tractable than $NP$-complete problems?
Mar 7, 2011
question
70
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Oct 4, 2010
answer
54
What papers should everyone read?
Sep 12, 2010
answer
48
How do you get a "Physical Intuition" for results in TCS?
Feb 9, 2011
answer
47
What are the best current lower bounds on 3SAT?
Aug 17, 2010
question
41
A fixed-depth characterization of $TC^0$? $NC^1$?
Oct 21, 2010
answer
40
Problems that can be used to show polynomial-time hardness results
Sep 14, 2010
answer
40
Inspirational talk for final year high school pupils
Oct 23, 2010
Top Meta posts
1
6
10
Site's policy regarding links to unauthorised copies of books
9
Why was "All pairs shortest path in undirected and unweighted graphs" closed and migrated?
9
What should our site/domain name be?
8
Nominations for publicity poster at FOCS ?
5
Homework, or things that look like homework.
Top network posts
View all network posts
74
Can a mathematical definition be wrong?
29
All pairs shortest path in undirected and unweighted graphs
29
Super-linear time complexity lower bounds for any natural problem in NP?
26
Finding a cycle of fixed length
24
does the "convolution theorem" apply to weaker algebraic structures?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.