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.
178
answers
77
questions
~50k
people reached
-
Toronto, Canada
-
Member for 10 years, 5 months
-
505 profile views
-
Last seen Jan 5 at 4:59
Communities (17)
- Theoretical Computer Science 21k 21k 88 gold badges7676 silver badges175175 bronze badges
- Computer Science 20.9k 20.9k 33 gold badges4646 silver badges105105 bronze badges
- MathOverflow 4.7k 4.7k 11 gold badge2828 silver badges4747 bronze badges
- Islam 3.6k 3.6k 1818 silver badges3737 bronze badges
- Academia 3.2k 3.2k 11 gold badge1111 silver badges1414 bronze badges
- View network profile
Top network posts
- 419 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?
- 208 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?
- 77 Can we cover the unit square by these rectangles?
- View more network posts →
Top tags (59)
Score
479
Posts
227
Posts %
89
Score
86
Posts
19
Score
40
Posts
14
Badges (73)
Gold
—
Silver
24
Rarest
-
Jul 14 '11
-
Sep 22 '14
-
Jul 2 '14
Bronze
49
Rarest
-
Jun 26 '13
-
Sep 22 '12
-
Nov 28 '10