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.
-
Toronto, Canada
-
Member for 7 years, 10 months
-
4 profile views
-
Last seen Feb 21 '16 at 22:12
Communities (17)
- Theoretical Computer Science 20.7k 20.7k 88 gold badges7171 silver badges173173 bronze badges
- Computer Science 19.8k 19.8k 33 gold badges4545 silver badges104104 bronze badges
- MathOverflow 4.6k 4.6k 11 gold badge2626 silver badges4747 bronze badges
- Islam 3.6k 3.6k 1616 silver badges3636 bronze badges
- Mathematics 3k 3k 2121 silver badges3333 bronze badges
- View network profile →
Top network posts
- 371 What is the definition of P, NP, NP-complete and NP-hard?
- 197 I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
- 183 What is the definition of P, NP, NP-complete and NP-hard?
- 123 Major unsolved problems in theoretical computer science?
- 119 Advice on good research practices
- 91 Major unsolved problems in theoretical computer science?
- 73 Can we cover the unit square by these rectangles?
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Badges (10)
Gold
—
Silver
7
Rarest
Bronze
3
Rarest
-
May 12 '14
-
Jul 27 '12
-
Sep 24 '14