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.
10
answers
3
questions
~11k
people reached
-
Toronto, Canada
-
Member for 10 years, 8 months
-
112 profile views
-
Last seen Jun 23 '20 at 3:26
Communities (17)
- Computer Science 21.1k 21.1k 33 gold badges4747 silver badges107107 bronze badges
- Theoretical Computer Science 21k 21k 88 gold badges7676 silver badges177177 bronze badges
- MathOverflow 4.8k 4.8k 11 gold badge3030 silver badges4848 bronze badges
- Islam 3.7k 3.7k 1818 silver badges3737 bronze badges
- Mathematics 3.3k 3.3k 2222 silver badges3535 bronze badges
- View network profile
Top network posts
- 428 What is the definition of P, NP, NP-complete and NP-hard?
- 214 I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
- 212 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?
- 80 Can we cover the unit square by these rectangles?
- View more network posts →
Top tags (12)
Score
71
Posts
13
Posts %
100
Badges (27)
Gold
—
Silver
12
Rarest
-
Dec 17 '12
-
Oct 24 '17