858 reputation
1023
bio website ce.sharif.edu/~dousti
location Tehran, Iran
age 31
visits member for 4 years, 2 months
seen Dec 22 at 7:27

I'm a Ph.D. candidate, studying computer science. My research interests include Foundations of Cryptography and Computational Complexity Theory.

My Ph.D. thesis title is "Conceptual Analysis and Improvement of Zero-Knowledge Models."


Dec
20
awarded  Constituent
Dec
9
awarded  Caucus
Dec
1
awarded  Altruist
Nov
30
comment Understanding the complexity class $P^O$ for randomized oracles
Oh, I see. Thanks for the magical explanation, it's now crystal clear :)
Nov
30
comment Understanding the complexity class $P^O$ for randomized oracles
I believe $M$ cannot simply return the answer of the $BPP$ oracle. For the oracle, it is acceptable if it decides the language membership with probability better than (say) 2/3. However, the deterministic machine $M$ should "perfectly" decide the membership: It should output 1 if and only if the input belongs to some language.
Nov
30
comment Understanding the complexity class $P^O$ for randomized oracles
Please clarify this point: $M^O$ is a deterministic machine if $M$ is a deterministic machine. So, shouldn't $P^{BPP}$ be a deterministic complexity class?
Nov
26
awarded  Investor
Oct
11
awarded  Yearling
Jul
2
awarded  Curious
May
24
answered what is the relationship between the complexity class E(and EXP) and NP?
May
7
awarded  Notable Question
Feb
16
awarded  Good Question
Feb
8
comment How to solve equations of type $x^x = k \pmod{n}$
@Benh: That was a fascinating observation! But the problem requires $x < n$.
Feb
8
comment How to solve equations of type $x^x = k \pmod{n}$
@GerryMyerson: Is it possible to establish an evidence for the hardness of this problem?
Feb
8
asked How to solve equations of type $x^x = k \pmod{n}$
Nov
16
awarded  Popular Question
Nov
3
awarded  Nice Question
Oct
11
awarded  Yearling
Sep
23
asked A tight lower bound for the entropy of the XOR of two random variables
Sep
8
awarded  Popular Question