Computer Science
Aden Dong's user avatar
Aden Dong's user avatar
Aden Dong's user avatar
Aden Dong
  • Member for 11 years, 6 months
  • Last seen more than 4 years ago
  • Toronto, Canada
Profile Activity
Stats
1,121
reputation
40k
reached
2
answers
12
questions
Communities
About

I am a student.

Badges
View all badges
1
gold badge
9
silver badges
24
bronze badges
Top tags
View all tags
5
Score
3
Posts
21
Posts %
5
Score
2
Posts
14
Posts %
5
Score
2
Posts
14
Posts %
5
Score
2
Posts
14
Posts %
2
Score
5
Posts
36
Posts %
2
Score
5
Posts
36
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
24
Reduce the following problem to SAT
Nov 7, 2012
question
21
How to use a greedy algorithm to find the non-decreasing sequence closest to the given one?
Jun 1, 2012
question
21
Do the minimum spanning trees of a weighted graph have the same number of edges with a given weight?
Jun 2, 2012
question
8
Maximum number of points that two paths can reach
Jun 29, 2012
question
6
How to find spanning tree of a graph that minimizes the maximum edge weight?
Jun 4, 2012
question
6
What is the number of expressions containing n pairs of matching brackets with nesting limit?
Jun 28, 2012
answer
5
What is the number of expressions containing n pairs of matching brackets with nesting limit?
Jun 28, 2012
question
4
Find an undecidable language that is mapping-reducible to its complement
Oct 16, 2012
question
3
Prove the following problem is NL-complete
Dec 3, 2012
question
2
How to use dynamic programming to solve this?
Jun 26, 2012
Top network posts
View all network posts
17
If $f_n(x_n) \to f(x)$ whenever $x_n \to x$, show that $f$ is continuous
10
How to show product of two nonmeasurable sets is nonmeasurable?
9
Show that $\pi \notin Q(\pi^3)$
9
Is every weak contraction a contraction?
8
Equivalence of definitions for upper semicontinuity

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.