Stack Exchange

Willard Zhan

http://www.cs.princeton.edu/~weizhan

top accounts reputation activity favorites subscriptions

Top Questions

Bipartite matching with degree domination

graph-theory matching asked Nov 14 '16 at 16:40

cstheory.stackexchange.com

Homework: Smooth mapping $f$ satisfying $f\circ f=f$

homework analysis asked Jul 21 '13 at 10:27

math.stackexchange.com

Top Answers

Several papers appear to imply P=NP via chordal graphs, what is wrong?

cstheory.stackexchange.com

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?

cs.stackexchange.com

Selling blocks of time slots

cs.stackexchange.com

Can two different complexity classes be equal relative to an oracle? Example request

cs.stackexchange.com

How hard is deciding the existence of Red-Blue perfect matching?

cstheory.stackexchange.com

On an equality of $x \bmod 1$

math.stackexchange.com

Name of this rearranging/sorting problem?

cs.stackexchange.com

An $n$th root inequality: $\sqrt[n]{n} < 1 + \sqrt{2/n}$

math.stackexchange.com

Prove: $xy+yz+zx\leq \frac{16}{3}$

math.stackexchange.com