1,909 reputation
827
bio website chaoxuprime.com
location Stony Brook, NY
age 23
visits member for 2 years, 10 months
seen May 19 at 18:59
stats profile views 943

PhD student in CS theory at UIUC starting at Fall 2013.

I'm interested in algorithms, computational geometry, theory of computation and problem solving in general.


Apr
25
awarded  Popular Question
Apr
17
awarded  Nice Question
Mar
27
asked What is the name for this relation between metric spaces?
Mar
25
accepted Minimum ceiling height to move a closet to upright position
Mar
25
comment Minimum ceiling height to move a closet to upright position
Why is it 2 degrees of freedom instead of 3?
Mar
25
comment Minimum ceiling height to move a closet to upright position
No, I just added an attribution for this. Good catch.
Mar
24
revised Minimum ceiling height to move a closet to upright position
added 71 characters in body
Mar
24
revised Minimum ceiling height to move a closet to upright position
added 35 characters in body
Mar
24
comment Minimum ceiling height to move a closet to upright position
I think I didn't write the problem clearly. By moving it in the way in the diagram, then certainly it would need this much height. I was querying if we can do any kind of movement to the box, can we stand it up use less than that height.
Mar
24
comment Minimum ceiling height to move a closet to upright position
Yes, $c$ is larger. I asked for the proof, but it was after the picture, so it's hard to see. I have moved it before the picture.
Mar
24
revised Minimum ceiling height to move a closet to upright position
added 4 characters in body
Mar
24
comment Minimum ceiling height to move a closet to upright position
If anyone is interested. I solved the real life version by assemble it standing up.
Mar
24
asked Minimum ceiling height to move a closet to upright position
Mar
5
awarded  Popular Question
Feb
15
asked Pairing two algebra structures of the same type and result the same type of algebra structure
Feb
15
accepted Can product of all pairwise sums be computed faster than the naive method?
Feb
15
comment Can product of all pairwise sums be computed faster than the naive method?
If I'm not mistaken, the middle one would use $O(n \log n)$ arithmetic operations. I can't find anything on how many arithmetic operations are required to find the resultant of a polynomial. I'm not familiar with computational algebra, but it seems it's quite difficult to find time complexity analysis of algorithms and express it in a way so CS people would understand...
Feb
15
revised Can product of all pairwise sums be computed faster than the naive method?
added 75 characters in body; edited tags
Feb
15
asked Can product of all pairwise sums be computed faster than the naive method?
Jan
31
revised Generalize the relationship between path length and minimum degree to weighted graphs
added 1 characters in body