Skip to main content
Theoretical Computer Science
Heda Chen's user avatar
Heda Chen's user avatar
Heda Chen's user avatar
Heda Chen
  • Member for 2 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
191
reputation
370
reached
0
answers
3
questions
Communities
View all
About

I'm Heda Chen, a senior undergraduate@SJTU.

Currently researching on

  • computational complexity
    • Polynomial modulo degree of Boolean functions
    • Algorithmic hardness by topological complexity barriers
Badges
This user doesn’t have any gold badges yet.
This user doesn’t have any silver badges yet.
5
bronze badges
Top tags
0
Score
3
Posts
100
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
0
Score
1
Posts
33
Posts %
Top posts
question
6
How to intuitively express the hardness of Minicrypt and Cryptomania?
Jan 6
question
3
The $O(n^{1/r})$ upper bound of polynomial degree of OR over composite moduli
Jun 13, 2023
question
0
What’s the difference between P-computable distributions and P-samplable distributions?
Jan 6
Top network posts
View all network posts
5
Are there superexponential NP-complete problems?