Academia
Kaveh
  • Member for 9 years, 11 months
  • Last seen more than a month ago
Profile Activity
Stats
3,284
reputation
61k
reached
5
answers
1
question
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
1
gold badge
12
silver badges
15
bronze badges
Top tags
View all tags
224
Score
2
Posts
33
Posts %
224
Score
1
Posts
17
Posts %
224
Score
1
Posts
17
Posts %
6
Score
1
Posts
17
Posts %
6
Score
1
Posts
17
Posts %
5
Score
1
Posts
17
Posts %
Top posts
All Questions Answers
Votes Newest
224
I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
Mar 26 '14
17
What references must be acknowledged in a paper?
Jun 18 '12
6
When is it a good idea to let an academic department (or a professor) know that I have Asperger's (or ADD)?
Aug 4 '12
5
Are there any decent online undergrad computer science degrees or courses
Aug 4 '12
3
Why are papers without code but with results accepted?
Jun 13 '14
3
Is "no late work" a common policy?
Mar 30 '14
Top network posts
View all network posts
440
What is the definition of P, NP, NP-complete and NP-hard?
217
What is the definition of P, NP, NP-complete and NP-hard?
128
Major unsolved problems in theoretical computer science?
122
Advice on good research practices
95
Major unsolved problems in theoretical computer science?

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.