Skip to main content
Theoretical Computer Science
Kaveh's user avatar
Kaveh's user avatar
Kaveh's user avatar
Kaveh
  • Member for 14 years, 1 month
  • Last seen more than a week ago
Profile Activity
Stats
21,747
reputation
849k
reached
206
answers
64
questions
Communities
View all
About
Badges
View all badges
8
gold badges
84
silver badges
185
bronze badges
Top tags
View all tags
756
Score
151
Posts
56
Posts %
253
Score
53
Posts
20
Posts %
248
Score
34
Posts
13
Posts %
224
Score
41
Posts
15
Posts %
176
Score
24
Posts
9
Posts %
174
Score
32
Posts
12
Posts %
Top posts
View all questions and answers
answer
131
Major unsolved problems in theoretical computer science?
Aug 17, 2010
question
124
Advice on good research practices
Nov 13, 2010
answer
96
Major unsolved problems in theoretical computer science?
Aug 17, 2010
question
49
The importance of Integrality Gap
Aug 22, 2010
answer
48
Historical reasons for adoption of Turing Machine as primary model of computation.
Dec 8, 2010
question
43
What are the reasons that researchers in computational geometry prefer the BSS/real-RAM model?
Oct 11, 2010
question
36
Consequences of $\mathsf{NP}$ containing $\mathsf{BPP}$
Jan 7, 2013
question
35
Is $AC^0/poly \cap NP$ contained in $P$?
Oct 6, 2010
answer
33
Why doesn't P=NP imply P=AP (i.e. P=PSPACE)?
Mar 10, 2011
question
31
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
466
What is the definition of P, NP, NP-complete and NP-hard?
254
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?
97
Can we cover the unit square by these rectangles?
74
Are there subexponential-time algorithms for NP-complete problems?