Kaveh
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.
24
answers
3
questions
~18k
people reached
-
Toronto, Canada
-
Member for 10 years, 8 months
-
250 profile views
-
Last seen Dec 8 '19 at 17:21
Communities (17)
- Computer Science 21k 21k 33 gold badges4747 silver badges106106 bronze badges
- Theoretical Computer Science 21k 21k 88 gold badges7676 silver badges175175 bronze badges
- MathOverflow 4.8k 4.8k 11 gold badge2929 silver badges4747 bronze badges
- Islam 3.7k 3.7k 1818 silver badges3737 bronze badges
- Academia 3.2k 3.2k 11 gold badge1212 silver badges1414 bronze badges
- View network profile
Top network posts
- 422 What is the definition of P, NP, NP-complete and NP-hard?
- 213 I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
- 209 What is the definition of P, NP, NP-complete and NP-hard?
- 127 Major unsolved problems in theoretical computer science?
- 121 Advice on good research practices
- 95 Major unsolved problems in theoretical computer science?
- 79 Can we cover the unit square by these rectangles?
- View more network posts →
Top tags (26)
Score
71
Posts
14
Posts %
52
Score
35
Posts
5
Score
19
Posts
5
Badges (40)
Gold
—
Silver
15
Rarest
-
Aug 17 '13
-
Sep 1 '13
-
Jul 24 '13
Bronze
25
Rarest
-
Jun 25 '13
-
Jun 25 '13
-
Jun 26 '13