Stack Exchange

Timothy Sun

I'm currently a student at Columbia University.

top accounts reputation activity favorites subscriptions

Top Questions

The complexity of determining if a fixed graph is a minor of another

reference-request graph-theory co.combinatorics graph-algorithms asked Aug 23 '11 at 6:28

cstheory.stackexchange.com

Bounds on approximating frequency moments

ds.algorithms reference-request communication-complexity data-streams asked Dec 9 '11 at 7:44

cstheory.stackexchange.com

Top Answers

“Directed” problems that are easier than their “undirected” variant.

cstheory.stackexchange.com

Genus of the graph $K_{4,2,2,2}$

mathoverflow.net

NFA with exponential number of states when deteminized

cs.stackexchange.com