Skip to main content
Theoretical Computer Science
Kaveh's user avatar
Kaveh's user avatar
Kaveh's user avatar
Kaveh
  • Member for 15 years, 7 months
  • Last seen this week
Profile Activity

Stats

22,213
reputation
907k
reached
206
answers
65
questions
Communities
View all

About

Badges

View all badges
9
gold badges
89
silver badges
188
bronze badges

Top tags

View all tags
774
Score
151
Posts
56
Posts %
256
Score
53
Posts
20
Posts %
251
Score
34
Posts
13
Posts %
225
Score
41
Posts
15
Posts %
179
Score
24
Posts
9
Posts %
176
Score
32
Posts
12
Posts %

Top posts

View all questions and answers
132
Major unsolved problems in theoretical computer science?
Aug 17, 2010
127
Advice on good research practices
Nov 13, 2010
96
Major unsolved problems in theoretical computer science?
Aug 17, 2010
52
The importance of Integrality Gap
Aug 22, 2010
48
Historical reasons for adoption of Turing Machine as primary model of computation.
Dec 8, 2010
46
What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model?
Oct 11, 2010
38
Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$
Jan 7, 2013
35
Is $AC^0/poly \cap NP$ contained in $P$?
Oct 6, 2010
34
Why doesn't P=NP imply P=AP (i.e. P=PSPACE)?
Mar 10, 2011
33
Is there a candidate for a natural problem in $P/poly - P$?
Sep 25, 2010

Top Meta posts

77
178
26
Migration path from cstheory to CS.SE
26
Why I am stepping down
21
How to ask a good question
20
Is "theoretical" computer science too narrow?
15
We should stop claiming that this website is “research-level”

Top network posts

View all network posts
470
What is the definition of P, NP, NP-complete and NP-hard?
270
I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
232
What is the definition of P, NP, NP-complete and NP-hard?
103
Can we cover the unit square by these rectangles?
78
Are there subexponential-time algorithms for NP-complete problems?