Theoretical Computer Science
Marcythm's user avatar
Marcythm's user avatar
Marcythm's user avatar
Marcythm
  • Member for 1 year, 2 months
  • Last seen this week
Profile Activity
Stats
131
reputation
145
reached
0
answers
1
question
Communities
View all
About

I'm Marcythm, a junior 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
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
Top posts
All Questions Answers
Score Newest
question
3
The $O(n^{1/r})$ upper bound of polynomial degree of OR over composite moduli
Jun 13

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.