Theoretical Computer Science
Wei Zhan's user avatar
Wei Zhan's user avatar
Wei Zhan's user avatar
Wei Zhan
  • Member for 10 years, 3 months
  • Last seen this week
Profile Activity
Stats
723
reputation
4k
reached
8
answers
1
question
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
17
bronze badges
Top tags
View all tags
39
Score
4
Posts
44
Posts %
20
Score
3
Posts
33
Posts %
11
Score
2
Posts
22
Posts %
11
Score
1
Posts
11
Posts %
11
Score
1
Posts
11
Posts %
4
Score
1
Posts
11
Posts %
Top posts
All Questions Answers
Score Newest
answer
16
Several papers appear to imply P=NP via chordal graphs, what is wrong?
Mar 12, 2015
answer
11
How do separations in of query complexities imply complexity class separations relative to oracles?
Dec 3, 2022
answer
9
How hard is deciding the existence of Red-Blue perfect matching?
May 4, 2019
question
8
Bipartite matching with degree domination
Nov 14, 2016
answer
4
Minimal clique edge cover vs minimalist (assignment-minimum) ones
Dec 29, 2020
answer
4
Time/space lower bounds on Majority (in the multitape TM model)
Oct 24, 2022
answer
3
Unclear proof step in Feder and Greene's 1988 paper showing NP-Hardness of approximating k-center problem within a factor of 1.82
Nov 29, 2022
answer
3
A question about decision tree complexity
Mar 4
answer
2
Optimal solution for partitioning convex polygon
Feb 27, 2022
Top network posts
View all network posts
10
If $A \cap B$ or $A \cup B$ or $A \times B$ is recursively enumerable is it true to say that both $A$ and $B$ are recursively enumerable?
9
Selling blocks of time slots
8
Can two different complexity classes be equal relative to an oracle? Example request
7
Homework: Smooth mapping $f$ satisfying $f\circ f=f$
6
On an equality of $x \bmod 1$

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.