Theoretical Computer Science
Kaveh's user avatar
Kaveh's user avatar
Kaveh's user avatar
Kaveh
  • Member for 13 years, 3 months
  • Last seen this week
Profile Activity
Stats
21,507
reputation
826k
reached
205
answers
62
questions
top 0.60% overall
Communities
View all
About

Software Engineer at Google.

Ph.D. in Computer Science, University of Toronto, Department of Computer Science, Theory Group.
Thesis: "Uniformity and Nonuniformity in Proof Complexity", 2016

Ex-moderator on cstheory.

Badges
View all badges
8
gold badges
82
silver badges
183
bronze badges
Top tags
View all tags
752
Score
149
Posts
56
Posts %
250
Score
53
Posts
20
Posts %
247
Score
34
Posts
13
Posts %
224
Score
41
Posts
15
Posts %
173
Score
24
Posts
9
Posts %
173
Score
31
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
129
Major unsolved problems in theoretical computer science?
Aug 17, 2010
question
123
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
34
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
30
Curry-Howard and programs from non-constructive proofs
Mar 2, 2011
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
460
What is the definition of P, NP, NP-complete and NP-hard?
246
I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
229
What is the definition of P, NP, NP-complete and NP-hard?
96
Can we cover the unit square by these rectangles?
73
Are there subexponential-time algorithms for NP-complete problems?

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.