Mathematics
Kaveh's user avatar
Kaveh's user avatar
Kaveh's user avatar
Kaveh
  • Member for 12 years, 8 months
  • Last seen more than a month ago
Profile Activity
Stats
3,502
reputation
344k
reached
76
answers
10
questions
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
This user doesn’t have any gold badges yet.
26
silver badges
37
bronze badges
Top tags
View all tags
179
Score
55
Posts
64
Posts %
61
Score
11
Posts
13
Posts %
51
Score
16
Posts
19
Posts %
47
Score
10
Posts
12
Posts %
42
Score
6
Posts
7
Posts %
27
Score
10
Posts
12
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
24
How to prove the mathematical induction is true?
Feb 27, 2011
answer
21
First-Order Logic vs. Second-Order Logic
Feb 27, 2011
question
13
Why is observing 100 heads for a fair coin flips surprising?
Mar 28, 2021
answer
12
Why accept the axiom of infinity?
Jun 9, 2012
answer
12
Definition of time-constructible function
Jul 12, 2011
answer
11
Which one result in mathematics has surprised you the most?
Nov 20, 2010
answer
10
Why is integer factorization considered to be in NP if a quantum computer can compute a factorization in polynomial time?
Jan 30, 2012
answer
9
Is there a connection between length of sentence and length of proof?
Dec 12, 2010
answer
9
Can the principle of explosion be removed from constructive logic?
May 24, 2012
answer
8
Prove that a set of connectives is inadequate
Sep 7, 2012
Top Meta posts
3
10
30
Some lessons to learn from the 2017 elections
15
Migration from cstheory to Math.SE
13
A minor gripe about upvoting things that have been downvoted [pity upvotes]
6
Troll or skeptic?
6
On downvoting for reasons independent of post content, e.g. chat behavior
Top network posts
View all network posts
453
What is the definition of P, NP, NP-complete and NP-hard?
239
I believe I have solved a famous open problem. How do I convince people in the field that I am not a crank?
226
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

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.