Skip to main content
Computer Science
Heda Chen's user avatar
Heda Chen's user avatar
Heda Chen's user avatar
Heda Chen
  • Member for 2 years, 4 months
  • Last seen more than a week ago
Profile Activity
Stats
311
reputation
4k
reached
9
answers
2
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.
1
silver badge
9
bronze badges
Top tags
View all tags
10
Score
6
Posts
55
Posts %
9
Score
3
Posts
27
Posts %
2
Score
2
Posts
18
Posts %
2
Score
1
Posts
9
Posts %
2
Score
1
Posts
9
Posts %
2
Score
1
Posts
9
Posts %
Top posts
View all questions and answers
answer
5
Are there superexponential NP-complete problems?
Aug 1, 2022
question
3
Can fine-grained hardness be proved directly from classical hardness (e.g., $\sf P \neq NP$) in some way?
Jul 30, 2022
answer
2
Reduce Subset-Sum to Sat
Jul 26, 2022
answer
2
Why HC-k-regular-(n-even) being NP-Complete implies HC-k-regular is NP complete?
Sep 15, 2022
answer
2
Probabilistic methods for undecidable problem
Oct 10, 2022
question
1
construct language in ${\sf BPP \backslash (RP \cup coRP)}$ assuming $\sf RP \neq ZPP$
Jul 29, 2022
answer
1
How can we show that P is not closed under taking all long prefixes?
Jul 24, 2022
answer
1
show for any Languages $L_1$ and $L_2$ exists a Language $L$ with $L_1 \leq_{log} L$ and $L_2 \leq_{log} L$
Aug 22, 2022
answer
0
Algorithm with amortized time complexity
Jul 31, 2022
answer
0
Intuition for Sipser's proof of PDA to CFG
Aug 22, 2022
Top network posts
View all network posts
6
How to intuitively express the hardness of Minicrypt and Cryptomania?