839 reputation
212
bio website
location
age
visits member for 2 years
seen Apr 19 at 21:09

Apr
2
awarded  Yearling
Jan
19
awarded  Nice Question
Jul
3
accepted A hard $n$-fold integral
Jul
3
answered A hard $n$-fold integral
Jun
28
comment What is the meaning of $O(m+n)$?
+1, I for one agree with that last sentence!
Jun
28
comment A hard $n$-fold integral
I took a call on this question and posted a copy on MO: mathoverflow.net/questions/135076/an-np-hard-n-fold-integral
Jun
25
asked A hard $n$-fold integral
Apr
2
awarded  Yearling
Mar
8
awarded  Nice Question
Jan
13
awarded  Popular Question
Nov
2
awarded  Citizen Patrol
Oct
30
comment How to prove $L \cdot L^{*} = L^{+}$
What about a concrete example :$L=\{0,1\}$? Can you extend this to a finite alphabet?
Oct
27
answered Trigonometry in computer science
Oct
26
revised Adjacent house , dynamic programming problem
added 212 characters in body
Oct
25
comment Adjacent house , dynamic programming problem
Yes, you should be able to make do with a 1D array.
Oct
25
answered Adjacent house , dynamic programming problem
Oct
24
comment What is the time complexity of computing $\frac{1}{2^n} {{n}\choose{(n+2)/2}}$
The number of multiplications is indeed $O(n)$ if that's what you mean by time complexity. Note that you can compute $2^n$ in $\log(n)$ multiplications by binary exponentiation. But what about the cost of the multiplications themselves?
Oct
24
comment Recurrence relation for time complexity $T(n) = T(n-1) + n^2$
Exactly, that's right
Oct
24
revised Comparing rational numbers
added 228 characters in body
Oct
24
answered Recurrence relation for time complexity $T(n) = T(n-1) + n^2$