Tour
About Us
Meta
Loading…
Log in
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Stack Exchange
All Sites
Top Users
Digests
Timothy Sun
I'm currently a student at Columbia University.
top
accounts
reputation
activity
bookmarks
subscriptions
Top Questions
26
votes
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
11
votes
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
18
“Directed” problems that are easier than their “undirected” variant.
cstheory.stackexchange.com
13
Genus of the graph $K_{4,2,2,2}$
mathoverflow.net
10
NFA with exponential number of states when determinized
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
mathoverflow.net
cs.stackexchange.com